In this paper we firstly give majorization relations between the vectors Fn = {f0, f1, . . . , fn−1},Ln = {l0, l1, . . . , ln−1} and Pn = {p0, p1, . . . , pn−1} which constructed with fibonacci, lucas and pell numbers. Then we give upper and lower bounds for determinants, Euclidean norms and Spectral norms of Gram matrices GF=〈Fn,Fni〉, GL=〈Ln,Lni〉, GP=〈Pn,Pni〉, GFL=〈Fn,Lni〉, GFP=〈Fn,Pni〉.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In this article, we formalize in Mizar [14] the definition of embedding of lattice and its properties. We formally define an inner product on an embedded module. We also formalize properties of Gram matrix. We formally prove that an inverse of Gram matrix for a rational lattice exists. Lattice of Z-module is necessary for lattice problems, LLL (Lenstra, Lenstra and Lov´asz) base reduction algorithm [16] and cryptographic systems with lattice [17].
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In this article, we formalize the definition of lattice of ℤ-module and its properties in the Mizar system [5].We formally prove that scalar products in lattices are bilinear forms over the field of real numbers ℝ. We also formalize the definitions of positive definite and integral lattices and their properties. Lattice of ℤ-module is necessary for lattice problems, LLL (Lenstra, Lenstra and Lovász) base reduction algorithm [14], and cryptographic systems with lattices [15] and coding theory [9].
4
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In this paper we characterize Moore-Penrose inverses of Gram matrices leaving a cone invariant in an indefinite inner product space using the indefinite matrix multiplication. This characterization includes the acuteness (or obtuseness) of certain closed convex cones.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.