Questions tagged [euclidean-lattices]
The euclidean-lattices tag has no usage guidance.
72
questions
1
vote
1answer
38 views
Minimal volume of fundamental domains of lattices
Consider a full rank integer lattice in $\mathbb{R}^n$. Let $v_1$ be the shortest non-zero vector in the lattice, $v_2$ be the shortest one among those not parallel to $v_1$, $v_3$ be the shortest one ...
3
votes
0answers
50 views
Deep Holes of the tensor product of two lattices
Let $L_0, L_1$ be Euclidean lattices (say full rank) of dimension $n_i$. Let $\lambda_1(L_i)$ denote the length of the shortest vector of $L_i$, and let $\rho(L_i)$ denote the covering radius of $L_i$:...
6
votes
2answers
539 views
what is the number of paths returning to 0 on the hexagonal lattice
I am looking for an estimation of the number of paths of length $n$ going from 0 to 0 on the hexagonal (or honeycomb) lattice.
I can find plenty on references on self avoiding paths, but I am looking ...
7
votes
3answers
540 views
What other lattices are obtainable from this noncommutative ring?
Here I will regard $SU(2)$ as the multiplicative group of unit quaternions.
There are just three conjugacy classes of finite subgroups $G < SU(2)$ where $[G:C] > 2$ for all cyclic subgroups $C &...
3
votes
2answers
139 views
Alternating 1D lattice sum
Are there any equivalent representations of the following (real valued) sum, in particular that are suitable for evaluation as $z\rightarrow0$ ?
$$ S=\sum_{k=-\infty}^\infty \frac{i^k(z-2ik)}{(\rho^2+(...
4
votes
1answer
86 views
Closed cobounded additive submonoid of $\mathbb{R}^n$
Let $M$ be a closed additive submonoid of $\mathbb{R}^n$ with $n\geq1$. Suppose also that there exists $r>0$ such that every ball of radius $r$ intersects $M$. I wonder if we can obtain more ...
3
votes
0answers
51 views
Selfsimilar lattices in $\mathbb R^d$
Let $\Lambda\subset \mathbb R^d$ a discrete subgroup, up to diminishing $d$ we assume it is of the form $A\mathbb Z^d$ with $A\in GL(d)$. Up to dilation we assume that the shortest vector in $\Lambda\...
1
vote
0answers
73 views
Shortest vectors in tensor product and maximal lattices in tensor product
$\mathcal L$ and $\mathcal L'$ be full rank lattices in $\mathbb R^n$ with shortest vectors $v_1,\dots,v_n$ and $v_1',\dots,v_n'$ respectively where $$\|v_1\|_2\leq\dots\leq\|v_n\|_2$$
$$\|v_1'\|_2\...
4
votes
2answers
886 views
Can we count the number of integer lattice points in this case?
Gauss Circle problem gives the number of lattice points lie within a circle of radius $r$. This question points to a reference that estimates the number of lattice points in a $d−$dimensional ball.
$...
14
votes
0answers
315 views
The Monster Moonshine Module from the engineering or algorithmic point of view
From what I understand (see, e.g., this question), the Monster Moonshine Module is a kind if "third generation" (or "second quantization"?) after the Golay code (with automorphism group $M_{24}$) and ...
9
votes
1answer
323 views
Tiling with incommensurate triangles
Say that two triangles are incommensurate if they do not
share an edge length or a vertex angle, and their areas differ.
Suppose you'd like to tile the plane with pairwise incommensurate triangles.
I ...
5
votes
0answers
196 views
Isomorphism classes of lattices
Suppose we have a $4 \times 6$ matrix $A$ of rank $4$ whose entries are rational numbers. Define
$$
V = \{x \in \mathbb R^6 \mid A \cdot x = 0\}
$$
and
$$
\Lambda = \{x \in \mathbb Z^6 \mid A \cdot ...
8
votes
0answers
90 views
Counting symmetric convex bodies with no nonzero lattice point in the interior
In order to estimate the size of the torsion in the algebraic $K$-groups of $\mathbb Q$ one needs to understand the homology of $\mathrm{GL}_n(\mathbb Z)$, or alternatively, the homology of the space ...
3
votes
1answer
145 views
Distance for $GL_n(\mathbb{R})/GL_n(\mathbb{Z})$
One can define the convergence of a sequence $(\Lambda_k)_k$ of full rank lattices as folow : $(\Lambda_k)\underset{k\rightarrow +\infty}{\longrightarrow} \Lambda \iff \forall k\in \mathbb{N} ,\exists ...
0
votes
1answer
74 views
Existence of linearly indépendants vectors reaching each minima of a lattice
I was wondering : given a full rank lattice $\Lambda$ of $R^n$ (a discrete subgroup spanning $R^n$) the successive minima of $\Lambda$ are for $1\leqslant i \leqslant n$ $\lambda_i= \min\{r>0 \mid \...
5
votes
0answers
757 views
Fractal covering of a plane with complex-base numeral systems - is periodicity necessary?
Taking a base $z$ positional numeral system with digits $a_k\in \{0,\ldots,n-1\}$:
$$s:\left\{(a_k)\in\{0,\ldots,n-1\}^{\mathbb{Z}}: \exists_K \forall_{k>K} \ a_k=0\right \}\to \sum_{k\in\mathbb{...
3
votes
0answers
31 views
Periodicity of density of laminated lattices
In Sphere Packings, Lattices and Groups, Conway and Sloane explore laminated lattices. If we let $X_d$ be the set of $d$-dimensional Euclidean lattices where every pair of points are separated by ...
3
votes
0answers
62 views
Lattice basis reduction over rings of number fields
Can one use lattice basis reduction algorithms, such as LLL over (low-rank) module lattices over rings of number fields of degree greater than 1? Is there any work on lattice reductions over Euclidean ...
4
votes
1answer
131 views
On necessary condition for no integer points in polytope
For a convex polytope $\mathcal K$ in $\Bbb R^n$ presented by $O(n^c)$ linear inequalities is it true that for $|\mathcal K\cap \Bbb Z^n|=0$ it is necessary that at least one axis of John's ellipsoid ...
2
votes
0answers
110 views
Gap in Successive minima on lattice spanned by rational and integer combination of integer vectors
We are given a rank $r$ matrix $B\in\Bbb Z^{k\times n}$ where $0\leq r\leq k\leq n$ holds.
We have
$$\mathcal L_\Bbb Z=\{uB\in\Bbb Z^n:u\in\Bbb Z^k\}\subseteq\mathcal L_\Bbb Q=\{uB\in\Bbb Z^n:u\in\...
2
votes
2answers
100 views
Integer points spanned by real, rational and integer combination of integer vectors
We are given a rank $r$ matrix $B\in\Bbb Z^{k\times n}$ where $0\leq r\leq k\leq n$ holds.
We have $\mathcal L_\Bbb Z\subseteq \mathcal L_\Bbb Q\subseteq\mathcal L_\Bbb R$ where
$$\mathcal L_\Bbb Z=\...
1
vote
1answer
108 views
Closest vertex in a 3D fcc lattice
The 3D fcc (face-centered-cubic) lattice, which has the same packing ratio as the 3D hexagonal close packed lattice, has the following 12 vectors connecting each vertex with its neighbors:
$(1,-1,0),...
2
votes
1answer
160 views
“Sparse” Theta Series
The number of integer points with a given norm in the integer grid $\mathbb{Z} \times \mathbb{Z}$ may be calculated via the generating function
$$\theta_3(q)^2= \left(\sum_{n \in \mathbb{Z}} q^{n^2}\...
10
votes
1answer
377 views
The lattice handshake number (“nearly kissing” number)?
Update: I'm happy to say that this question has been made essentially obsolete by the breakthrough result of Serge Vlăduţ, who showed that the kissing number is exponentially large: https://arxiv.org/...
1
vote
1answer
114 views
Densest sphere packing for a given lattice
There is a great deal of fascinating work on the sphere packing problem. I was wondering if there exist methods to find the densest possible packing of a sublattice of a given lattice. In particular, ...
2
votes
0answers
42 views
Bound on the fundamental region of a sublattice of a Niemeier Lattice
I am working with an 18 dimensional lattice, $W$ say, primitively embedded into a given Niemeier lattice $\mathcal{N}_i$. I am trying to figure out the following: what is the smallest possible ...
6
votes
0answers
183 views
Positive-definite lattice with O(n,n) Gram matrix generated by minimal vectors
Consider a positive-definite $2n$-dimensional lattice with minimum norm $\mu$. It is sometimes possible to find a generating set of minimal vectors for the lattice such that the Gram matrix takes the ...
2
votes
0answers
53 views
Configurations of minimal vectors for a 4-dimensional symplectic lattice
The possible configurations of minimal vectors for a 4-dimensional lattice are known for ages, but what about symplectic lattices ? If a 4-dimensional symplectic lattice $\Lambda$ has two minimal ...
1
vote
0answers
99 views
On dimension of Segre embedding of lattice translations
Consider three lattices $L_1$, $L_2$ in $\Bbb Z^{n+1}$ and $L$ in $\Bbb Z^{2n+1}$.
Let $L_1+v_1$, $L_2+v_2$ and $L+v$ be their respective translationsfor some $v_1,v_2\in\Bbb Z^{n+1}\backslash\{(0,\...
0
votes
2answers
262 views
Lattice question
Consider a lattice $\mathcal{L} = \mathbb{Z}v_1 \oplus \ldots \oplus \mathbb{Z}v_l$ in $\mathbb{R}^n$ and let $S_0$ be the set of edges of the fundamental unit of $\mathcal{L}$. We call a region $X$ ...
5
votes
0answers
117 views
Lattice paths in polytopes
Let $P$ be a polytope in $\mathbb{R}^n$. Let $A_ix = b_i$ be the defining equations of its codimension $1$ faces. Is there an algorithm or some kind of criterion to decide if the lattice points inside ...
5
votes
1answer
163 views
lattice with Voronoi cell inside a circle
This considers real-valued lattices in two dimensions.
I need to find the densest lattice $\Lambda$, i.e., the one with the smallest determinant of its generator matrix, such that the Voronoi cell of ...
2
votes
2answers
411 views
What is the spinor genus of the Leech lattice?
The Leech lattice and the 23 Niemeier lattices make a single genus. How does it break up into spinor genera?
6
votes
0answers
210 views
Bound on the determinant of a quadratic form restricted to a subspace
Let $Q\colon \mathbb{Z}^{n}\oplus\mathbb{Z}^m\to\mathbb{R}$ be a real quadratic form, which we denote $Q(x,y)$, $x\in\mathbb{Z}^n$, $y\in\mathbb{Z}^m$. Suppose:
The minimum of $Q(x,y)$ as $y$ varies ...
2
votes
1answer
231 views
Smallest angle among two lines in an n × n grid
Does anybody have a reference answering the following (at least for me surprisingly non trivial) question?
Given an $n \times n$ integer grid, what is the minimum angle between any two distinct lines,...
22
votes
1answer
640 views
Does $E_8$ know $Spin(7)$?
One way to define the compact group $Spin(7)$ is as the stabilizer of a certain 4-form on Euclidean $\mathbb R^8$ (see e.g. this MO question). This 4-form can be defined in various ways. For example,...
1
vote
0answers
340 views
How to count the number of shortest paths in a 2x2 grid? [closed]
Say that we have a 2x2 regular grid or network. We label the nodes 0 to 3 row-wise. Then, for each node, we want to compute the number of shortest paths that pass through them.
I have a Python code ...
16
votes
2answers
430 views
what is the equivalent of the Euler constant for higher dimensional lattices
Let $\Lambda$ be a unimodular lattice in $\mathbb R^d$. Then there are constants such that
$$\sum_{\substack{\gamma\in \Lambda\\0<|\gamma|<R\\}} \frac{1}{|\gamma|^d} = c_1 \log R + c_2 + o(1).$$...
1
vote
0answers
48 views
Lattice points with next-largest norm [closed]
In a 2D integer grid, the points in increasing distance from the origin are:
$(0,0)$
$(\pm1,0)$ and $(0,\pm1)$
$(\pm1,\pm1)$
etc
By symmetry we need only consider one-eighth of the lattice, $x\ge0$ ...
10
votes
0answers
175 views
Boomerangs in Polya's orchard
Polya's orchard problem asks for what radius $r$ of trees
at each lattice point within a distance $R$
of the origin block all lines of sight to the exterior of the orchard.
The answer is known; $r$ ...
0
votes
0answers
223 views
Writing integers in ring of integers of number fields
Given $a,b\in\Bbb N$, we can write $a=a_tb^t+a_{t-1}b^{t-1}+\dots+a_1b+a_0$ where $t=\lceil\log_ba\rceil$ and $a_i<b<a$.
(1) Supposing if $b\in\mathcal{O}_K$ where $\mathcal{O}_K$ is ring of ...
2
votes
0answers
117 views
Listing all Lattice Points in a Box
Let $B := [-1,1]^n$ be an $n$-dimensional box. Moreover, let $v_1,\ldots,v_n \in \mathbb{R}^n$ form a basis of $\mathbb{R}^n$, where the entries of the $v_i$ are explicitly irrational. We can assume ...
3
votes
0answers
105 views
Enumerating 1-Lipschitz functions on an integer grid
Let $G$ denote an integer grid consisting of $\{0,\dots,m\}\times\{0,\dots,n\}$. An integer-valued function $f:G\to\mathbb{Z}$ is said to be 1-Lipschitz if it satisfies $|f(x) - f(y)| \leq \| x-y \|$...
7
votes
1answer
390 views
Upper bound for the number of integral points in a convex set
Let $K \subset \mathbb{R}^3$ be a bounded convex set such that the points with integer
coordinates in $K$ are not all coplanar. Is it true that $|K \cap \mathbb{Z}^3| \leq 6{\rm Vol}(K) + 3$?
0
votes
0answers
838 views
Number of lattice points in a given triangle
Given a triangle with real coordinates, does anybody know how to find the number of lattice points contained within it? What if the points are only rational? I know Pick's formula can be used for the ...
6
votes
3answers
773 views
Probability that a self-avoiding walk on $\mathbb{Z}^3$ closes to a polygon
The probability that a random walk on $\mathbb{Z}^3$ returns to the origin is about 34%.
This is (part of)
Pólya's theorem.
I have been looking for an analogous (numerical) result for the probability
...
7
votes
1answer
885 views
Given a positive-definite integral unimodular Gram matrix, how to find a basis of the associated lattice (over $\mathbf Q$)?
Let $G$ be a $n\times n-$symmetric matrix with integral coefficients and determinant $1$ (i.e. unimodular) such that the associated quadratic form is positive-definite.
I am interested in having an ...
3
votes
1answer
295 views
Covering points with a shortest lattice spiral
Let $S$ be a finite set of lattice points in $\mathbb{Z}^2$.
My question is, roughly:
Q. How can a shortest lattice spiral that passes through
every point of $S$ be found?
A lattice spiral (my ...
10
votes
1answer
494 views
A random variation on Polya's orchard problem
Polya's orchard problem is as follows:
"How thick must the
trunks of the trees in a regularly spaced circular orchard grow if they are
to block completely the view from the center?"
See, e.g.,
...
6
votes
2answers
258 views
Covolume of the row span of a matrix and of the kernel of a matrix
Let $L$ be a $k$-dimensional lattice in $\mathbb{R}^n$. The covolume
$\hbox{CoVol}(L)$ of $L$ is the $k$-dimensional volume of a
fundamental domain for $L$, i.e., the volume of the parallelopiped
...
