Questions tagged [integer-lattices]

A lattice in $\mathbb R^n$ is a discrete subgroup of $\mathbb R^n$ or, equivalently, it is a subgroup of $\mathbb R^n$ generated by linearly independent vectors. Lattices have applications in geometric number theory, e.g. via Minkowski's theorem.

In geometry and group theory, a lattice in $\Bbb R^n$ is a subgroup of the additive group $\Bbb R^n$ that is isomorphic to the additive group $\Bbb Z^n$ and that spans the real vector space $\Bbb R^n$. In other words, for any basis of $\Bbb R^n$, the subgroup of all linear combinations with integer coefficients of the basis vectors forms a lattice. A lattice may be viewed as a regular tiling of a space by a primitive cell.

Lattices have many significant applications in pure mathematics, particularly in connection to Lie algebras, number theory, and group theory. They also arise in applied mathematics in connection with coding theory, in cryptography because of conjectured computational hardness of several lattice problems, and in the physical sciences. For instance, in materials science and solid-state physics, a lattice is a synonym for the "frame work" of a crystalline structure, a 3-dimensional array of regularly spaced points coinciding in special cases with the atom or molecule positions in a crystal.

894 questions
0
votes
1 answer

Blichfeldt vs Minkowski Theorems (Mathematics of Lattices)

I am trying to study and understand the basic theorems about mathematics of lattices. In particular, I understood statements and proofs of both Blichfeldt and Minkowski. My doubt was about their utility, I mean: the first one (Blichfeldt) states…
narger
  • 11
0
votes
0 answers

Lattice basis consisting of minimal vectors

I have the following theorem that I would like to prove: Let $\Lambda$ be an $m$-dimensional Lattice of $\mathbb{R}^n$ then $\Lambda$ has a basis consisting of $b_1,...,b_m$ with $||b_j||= \lambda_j(\Lambda)$ for $1 \leq j \leq min(m,4)$ where…
P_Gate
  • 214
0
votes
0 answers

Maximum vector contained in a cube (lattice)

We have some lattice $$\Gamma=\bigoplus_{i=1}^n\mathbb{Z}v_i$$where the length of each basis vector, as well as the angle between every two vectors, is bounded. Is there an upper bound for $|\Gamma\bigcap [0,1]^n|?$
Isomorphism
  • 437
  • 2
  • 10
0
votes
1 answer

Mapping Between Sequences: Example

Take $0\leq r < m$, and let all values be nonnegative and integer. Consider the function on a sequence ${x(n)}$, $\Phi_mx(mn+r)=mx(n)+\frac{r}{m}(x(n+1)-x(n))$, where we consider $x(0)=0$. As an example, $\Phi_3$ maps $1,1,2,3$ to…
114
  • 511
0
votes
1 answer

Conditions under which the Lattice Generated by a Subset of Lattice Vectors is Equivalent to the Original Lattice

In general, the sublattice $L_2$ generated by subset of vectors of $L_1$ need not have the same rank as $L_1$. Even if it does, it may be a proper sublattice of $L_1$. However, if the rank and determinant of $L_2$ matches those of $L_1$, then is…
0
votes
1 answer

What is the minimum of a translated lattice?

Given a lattice $\mathcal{L}$ with minimum $\lambda_1(\mathcal{L})$, how can we describe the minimum of a translated lattice $t + \mathcal{L}$ for some $t \in \text{span}(\mathcal{L})$, $t \notin \mathcal{L}$? (As $t + \mathcal{L}$ does not contain…
user323867
0
votes
1 answer

Let $A$ be the set of $2\times 2$ Boolean matrices with $MRN$ if and only if $m_{ij}\le n_{ij}$ for $i,j=1,2$. Is $(A,R)$ a lattice?

A Diagraph is said to be a lattice if every pair in lattice has least upper bound (LUB) and Greatest Lower Bound (GLB).
Diana
  • 3
0
votes
1 answer

Lattices generated by "small" matrices

Let $\Lambda$ be a lattice in $\mathbb R^n$ generated by the columns of a square matrix $B$ of order $n$. If $\Lambda$ is full rank, then the quantity $d(\Lambda)=|\det B|$ has a simple geometrical meaning: it is the volume of a fundamental…
W-t-P
  • 4,629
0
votes
2 answers

Center density of a lattice in Thompson's book

I'm reading the Thompson's book about lattices and sphere packing and got stuck by a sentence of a kind of $Z_8$ he introduced to reach 2 pages later the full $E_8$ lattice. You can find this lattice defined at pages 73-74 and it's basically. To…
0
votes
1 answer

Prove (or disprove) that quantizing the end-points of a line segment does not change its quantized points

Let $q(v) := \lfloor v + 1/2 \rfloor$ denote the operation of quantizing a real number towards the nearest integer. Fix $x_0, x_1, y_0$, and $y_1$ where $x_i \in \mathbb{Z}$ and $y_i \in \mathbb{R}$ (for $i=0,1$). Assume w.l.o.g that $x_0 <…
MikeL
  • 627
0
votes
0 answers

Determinant of a superlattice

I'm beginning to study lattices and cannot solve the following exercise from the book: Let $\Lambda=\left\langle\mathbb{Z}^n,\left(\frac{a_1}q,\ldots,\frac{a_n}q\right)\right\rangle$, where $\left(a_1,\ldots,a_n,q\right)=1$. Then…
0
votes
0 answers

Does E8 sphere packing proof use a computer

Does the proof by Maryna S. Viazovska that the E8 sphere packing is optimal use a computer?
0
votes
1 answer

How to cover integer pairs with lines efficiently?

Your goal is to to "tag" all points in $\mathbb{Z}^2$. At each step $i$ you can choose $(a_i,b_i)\in\mathbb{Z}^2$ and "tag" all points $S_{a, b, i} =\{(a - ik, b - k)|k\in\mathbb{Z}\}$ The objective is for each $i \in \mathbb{N}$ to choose…
gota
  • 911
0
votes
1 answer

Lattice generated by elements of minimal length

I'm following Miranda's book on algebraic curves and Riemann surfaces. In the section where he talks about the automorphisms group of the complex tori he claims the following: Let $L$ be a lattice in $\mathbb{C}^2$ of rank 2. Let $\gamma$ such that…
Lazward
  • 587
0
votes
1 answer

Is it easy to find a lattice vector whose length is in a specific interval?

Say $L$ is a lattice of ${\bf R}^n$ with rank $m$. Let $\alpha, \beta \ (\alpha<\beta)$ be positive real numbers. Set $A_{L}=\{{\bf x}\in L: \alpha\leq \|{\bf x}\|\leq \beta\}.$ It may be difficult to find an element of $A_{L}$ if for instance we…
111
  • 747
1 2 3
4