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.

learn more… | top users | synonyms

7
votes
0answers
235 views

How small parallelograms are we guaranteed to get, when we select the two sides from different plane lattices?

This a shortened version (motivation from telecommunications stripped away) of a question I asked in MO in late May (no answers). I am mostly checking, if somebody has seen this or a related question ...
4
votes
0answers
121 views

Adelic lattices

Let $\mathbb{A} = \widehat{\mathbb{Z}} \otimes \mathbb{Q} \times \mathbb{R}$ be the adeles over $\mathbb{Q}$. In Deligne's article "Formes modulaires et representations de GL(2)" he states without ...
3
votes
0answers
40 views

Number of points in the diagonal of an $X \times Y$ square lattice box.

So assuming we have a $X \times Y$ lattice, Say for example a $3 \times 5$ like so * * * * * * * * * * * * * * * I need to find the number of points that each ...
3
votes
0answers
50 views

Nonplanar equilateral lattice “pentagons”

It is well-known that no two-dimensional point lattice contains a regular pentagon. (See for example http://mathworld.wolfram.com/LatticePolygon.html) The same is true for lattices in $\mathbb{R}^n$, ...
3
votes
0answers
342 views

continued fractions and convex hulls

If I remember correctly, there is a nice correspondence between continued fractions and convex hulls of lattice points in the plane. If $\theta>0$ is the slope of a line in $\mathbb{R}^2$ passing ...
3
votes
0answers
153 views

The $n$-shortest lattice vectors problem in $\mathcal{R}^2$

I am looking for an algorithm to compute the $n$ shortest lattice vectors in $\mathcal{R}^2$. The problem statement is as follows: Given a lattice $L: \{ m \vec{u}+n\vec{v} \} \in \mathcal{R}^2$, a ...
2
votes
0answers
24 views

lattice walks with primes and composites

In the regular square lattice create a walk moving according the value of a counter. Consider two types of walks: In the first walk advance forward one unit if the counter is a composite number and ...
2
votes
0answers
39 views

Lattice generated by vectors orthogonal to an integer vector

Given a non-zero vector $\boldsymbol{v}$ composed of integers, imagine the set of all non-zero integer vectors $\boldsymbol{u}$, such that $\boldsymbol{u} \cdot \boldsymbol{v} = 0$, i.e., the integer ...
2
votes
0answers
38 views

Leech Lattice and Golay Code

Consider the following Miracle Octat Generator or MOG. Choose the sign $\pm 3$ and fill in the blanks $\pm 1$ to create a point $x$ in the Leech lattice $\Lambda_{24}$ with $||x||^2=8$. $ ...
2
votes
0answers
64 views

Dual Lattice definition

A lattice is a free abelian group $L$ together with a symmetric non-degenerate bilinear form $(,): L\times L\rightarrow \Bbb{Z}$. Let $H=\mathrm{Hom}(L,\Bbb{Z})$. I often see the dual of $L$ being ...
2
votes
0answers
33 views

lattice symmetries portrayed in animation

Below is an animated gif by Dave Whyte: What is the orbifold/fibrifold notation for the symmetries of the lattice depicted below? (a la /The Symmetries of Things/? Are there related theta function ...
2
votes
0answers
127 views

Lattice theory in mathematics and physics

I have undertaken a project examining lattice model and trying to construct algorithm that could work on all lattice (in physical sense, or crystal structure). I notice there is a branch in ...
2
votes
0answers
48 views

When does a simplex have an interior lattice point?

Given $r$ vectors $v_1, \dots, v_r$ in $\mathbb{Z}^n$, is there an easy way (in terms of the entries of the $v_i$) to determine if there is a point of $\mathbb{Z}^n$ in the interior of the simplex ...
2
votes
0answers
51 views

Automorphisms of a lattice and changing to a nicer $\mathbb{Z}$-base

Suppose I have an integral lattice $L$ with an arbitrary $\mathbb{Z}$-base, equipped with a positive-definite nondegenerate symmetric bilinear form $\langle\cdot,\cdot\rangle$, and an isometry $\nu$ ...
2
votes
0answers
132 views

Lattice Reduction Problem: Minimizing the “Longest” Basis Vector

Suppose we have a basis for an integer lattice formed by the vectors $\vec v_1, \vec v_2, \ldots,\vec v_n$. Then let $A$ be the augmented matrix $( \vec v_1| \space \vec v_2| \cdots |\space \vec ...
2
votes
0answers
76 views

Term for intersection of lattice and convex region?

Is there a special term or convenient phrase for the restriction of a convex region to points of a lattice? This is motivated by wanting to talk about the feasible points of a discrete problem. I'd ...
2
votes
0answers
292 views

Probability distribution of a self avoiding walk

Preliminary: Consider a walk on the lattice $\mathbb{Z}_d$ lattice of length $N$. In a normal random walk, if we let $N$ get large the end position has a probability distribution (PDF) that looks ...
2
votes
0answers
41 views

Bijection between $\operatorname{GL}_n(F)/\operatorname{GL}_n(O)$ and lattices in $F^n$

I've come across mention of a bijection between lattices in $F^n$ ($F$ a field, in my case $\mathbb{C}(\!(t)\!)$) and elements of $\operatorname{GL}_n(F)/\operatorname{GL}_n(O)$, where $O$ is the ring ...
2
votes
0answers
187 views

Construction of a symplectic basis for a lattice

Let $(T,E)$ be a polarized abelian variety ($T=V/L$, $\dim_\mathbb{C} V=g$, $E:V\times V\to\mathbb{R}$ a nondegenerate real alternating bilinear form, with $E(L\times L)\subseteq\mathbb{Z}$ and ...
1
vote
0answers
27 views

Prove that $a_{i,1}x_1 +a_{i,2}x_2 +···+a_{i,n}x_n ≤c_i, 1≤i≤n $ are all satisfied by a nonzero $n-tuple$ of integers.

My setting is that $c_1, · · · c_n$ are positive real numbers, and $A = [a_{i,j} ]$ is an $n × n$ non-singular matrix. Assume that $c_1 · · · c_n > | det(A)|.$ I want to prove that the n-linear ...
1
vote
0answers
20 views

Coexistance of certain vectors in a lattice

I'm currently working on the SVP (Shortest Lattice Vector Problem) as a part of a paper that I'm writing. I've been trying to prove ( or disprove) the following without too much success : Question : ...
1
vote
0answers
27 views

Lower bounds on possible integer relations from the PSLQ algorithm

For the equation: $$ \sum_{i=1}^na_ix_i=0 $$ where all $x_i$ are real numbers and all $a_i$ are integers, the PSLQ algorithm can either find an integer relation or give lower bounds on the norm of ...
1
vote
0answers
52 views

Finding a basis for a particular integer lattice

The following problem arose in the context of string theory. I hope someone here might provide some guidance or a solution... Our starting point is: i) an integer-lattice $L\subset\mathbb R^n$ ...
1
vote
0answers
31 views

Line and distance to lattice points?

Consider the lattice $\mathbb{Z}^{n}\subset\mathbb{R}^{n}$ and a line (not necessarily through the origin). What conditions can be placed on the slope of the line that is necessary and sufficient so ...
1
vote
0answers
84 views

Lattices in $\mathbb C$ as modules of the ring of integers in an imaginary quadratic field

Let $K$ be an imaginary quadratic number field and let $O_K\subset K$ be the ring of algebraic integers in $K$. Let us call a lattice $\Lambda\subset\mathbb C$ normalized if the tori $\mathbb ...
1
vote
0answers
22 views

$\Delta$ vs. $\delta$ in Lattice Theory

I'm learning about lattices and I'd like to confirm the difference between the density $\Delta$ and another density $\delta$. I would greatly appreciate if someone could confirm, correct, or even ...
1
vote
0answers
36 views

Estimate for the co-volume of discs centered at lattice points in the plane?

Suppose I have a unimodular lattice $\Lambda = A \mathbb{Z^2}$ ($A\in SL(2,\mathbb{R})$) in the plane. I place a disc of fixed radius, $r$, around each point of $\Lambda$, so that I have a union of ...
1
vote
0answers
51 views

The number of lattice points in d-dimensional ball

The following paper states that the number of lattice points in a $d$-dimensional ball of radius $R$ is $V_d R^d + O(R^\alpha)$ where $\alpha = d - 2$ and $V_d$ is the volume of the unit ...
1
vote
0answers
27 views

Ehrhart Polynomials Modulo Prime Integers

Are there any results known about computing Ehrhart Polynomials modulo prime integers?
1
vote
0answers
27 views

moduli of lattices

Consider the set $M$ of all (rank $g$) lattices in $g$-dimensional complex affine space $C^g$. Does M identify in some way with Siegel upper half space $H_g$? Let's say a lattice has CM if it has ...
1
vote
0answers
28 views

Which lattices are ideals of a number field?

Let $K$ be a number field, then its ring of integers $\mathcal{O}_K$ in the Minkowski space of $K$ is a lattice $\Lambda$. Is there some geometric descrpition/intuition that describes sublattices of ...
1
vote
0answers
31 views

Non zero Unimodular matrices

I have a question about the lattice reduction algorithms like LLL algorithm. Lattice reduction algorithms like LLL generate a unimodular matrix which makes more orthogonal basises for a given matrix. ...
1
vote
0answers
37 views

Is the Voronoi region of a lattice symmetric around origion?

Assume an n-dimensional lattice. Is the Voronoi region of the lattice symmetric around origion? In other word, is the following statement true? "if $x\in \mathcal{V}$ then $-x\in \mathcal{V}$" where ...
1
vote
0answers
55 views

Closest vector problem

Given is a vector $v=\begin{pmatrix}2,&-1,&0,&1\end{pmatrix}$ as the shortest vector of the lattice $\Lambda (B)$, where $B$ is determined as $B=\begin{pmatrix}4 &-3 & 2 & 0\\ ...
1
vote
0answers
63 views

Which matrices generate the same lattices?

Given are the following matrices: $A_{1}=\begin{bmatrix} 4 & 7 &9 \\ 3 & 5 &3 \\ 1 &2 &0 \end{bmatrix}$ , $A_{2}=\begin{bmatrix} 10 & 9 &6 \\ 11 & 7 &2 \\ ...
1
vote
0answers
33 views

integer programming with bounded dimension

We know that integer programming with bounded dimension or fixed number of variables can be solved in polynomial time by Lenstra's result(from results of the LLL algorithm). After heavy foraging i ...
1
vote
0answers
38 views

Inclusion-minimality of a lattice basis

An integer lattice is a subgroup of $\mathbb{Z}^n$. Since $\mathbb{Z}$ is PID, each lattice has a well-defined rank and a generating set of rank many elements is a basis. I wonder if there is a way ...
1
vote
0answers
87 views

A lattice-theoretic question related to noncommutative tori

[NCG] So I'm trying to pin down a fairly well-known bit of noncommutative-geometric folklore that says that for $\Theta \in M_N(\mathbb{Q})$ skew-symmetric, the corresponding noncommutative $N$-torus ...
1
vote
0answers
64 views

Why the following observations regarding lattices hold?

The following is an excerpt of a recent paper on lattice cryptography: Let $n$ and $q$ be integers [...], and let $\beta > 0$ . Given a uniformly random matrix $A \in \mathbb Z^{n \times m}_q$ ...
1
vote
0answers
145 views

solution count of quadratic form congruences

Let $(L,q)$ be an even Lorentzian lattice of signature $(1,l-1)$, i.e., $q(\lambda) \in \Bbb Z$ for all $\lambda \in L$ and the (non-degenerate) quadratic form $q$ is of type $(1,l-1)$ (the ...
1
vote
0answers
119 views

Norm of the generators of a fractional ideal.

Let $\mathcal{O}_l=\mathbb{Z}[\frac{1+\sqrt{-l}}{2}]$ with $l$ a prime number congruent to 3 mod 4. Let $\mathfrak{a}$ be a non-principal fractional ideal of $\mathcal{O}_l$. My questions are: Why ...
1
vote
0answers
384 views

How many amplitude levels does a squared QAM constellation have?

In the above question, I choose terminology from communication engineering, but I will precisely define all the involved quantities below. It is a geometric question and I am not sure if it is ...
1
vote
0answers
99 views

A variant of the “closest vector problem” (CVP) in lattice-based cryptography

Consider a public-key scheme on lattices, such as GGH. The private key is a basis $\mathbf{B} \in \mathbb{Z}^{m \times n}$ of a lattice $\mathcal{L}$ with good properties (such as short nearly ...
0
votes
0answers
12 views

Construction of lattice in a given genus

Recently I needed to find a lattice in a given genus (which I attained as an orthogonal sum of lower dimensional lattices), which led me to the question how one can costruct such a lattice in general. ...
0
votes
0answers
6 views

Finite differences on a hexagonal/triangular lattice with Cartesian coordinates

So, I've been thinking recently about how to approximate the Laplacian operator using finite differences on a non-square lattice. For example, on a typical square lattice, in a Cartesian coordinate ...
0
votes
0answers
34 views

What conditions are necessary for this property?

Let L be an ideal lattice. choose four elements a,b,c and d in L Let $A = \begin{bmatrix} a & b \\ c & d \end{bmatrix}$ 2 by 2 matrix. I think that $A=BCB^{-1}$ for some invetible matrix B ...
0
votes
0answers
5 views

Given a random unit cell's defining vectors in a random basis, what kind of lattice am I looking at?

So, as stated in the title, I have a lattice basis $B \in \mathbb{R}^{3\times 3}$ (given as a non-singular Matrix containing its unit cell vectors) which is arbitrarily rotated, scaled and reflected. ...
0
votes
0answers
28 views

Possible areas within an integer grid

Given a 1x1 grid with 4 lattice points $[(0,0),(0,1),(1,0),(1,1)]$ (equivalent to a $2 \times 2$ grid of vertices), there are 2 shapes and areas that can be formed: a triangle and a square. There are ...
0
votes
0answers
14 views

Volume of the lattice generated by an ideal

Let $F$ be a totally real number field, $\mathfrak a \subset F$ a fractional ideal. Consider a lattice in $\mathbb R^n$ consisting of vectors $(\sigma_1(v),..\sigma_n(v))$, where $\sigma_1,..\sigma_n$ ...
0
votes
0answers
11 views

Fast method or direct generation of random upper triangular matrix using integer-restricted gauss elimination

I'd like to generate non-singular random upper triangular matrices of the following form: $$ \left[\begin{matrix} 1 & r_1 \cos{\alpha_1} & r_2 \cos{\alpha_2} & r_3 \cos{\alpha_3} & ...