Related papers: Lattices and codes with long shadows
It is shown that an n-dimensional unimodular lattice has minimal norm at most 2[n/24] +2, unless n = 23 when the bound must be increased by 1. This result was previously known only for even unimodular lattices. Quebbemann had extended the…
The highest possible minimal norm of a unimodular lattice is determined in dimensions n <= 33. There are precisely five odd 32-dimensional lattices with the highest possible minimal norm (compared with more than 8*10^20 in dimension 33).…
We use theta series and modular forms to prove that Z^n is the only integral unimodular lattice of rank n without characteristic vectors of norm <n, i.e. the only integral unimodular lattice not containing a vector w such that (w,w)<n and…
In this paper, we construct odd unimodular lattices in dimensions n=36,37 having minimum norm 3 and 4s=n-16, where s is the minimum norm of the shadow. We also construct odd unimodular lattices in dimensions n=41,43,44 having minimum norm 4…
We show that on an $n=24m+8k$-dimensional even unimodular lattice, if the shortest vector length is $\geq 2m$, then as the number of vectors of length $2m$ decreases, the secrecy gain increases. We will also prove a similar result on…
Given a polarization of an even unimodular lattice and integer $k\ge 1$, we define a family of unimodular lattices $L(M,N,k)$. Of special interest are certain $L(M,N,3)$ of rank 72. Their minimum norms lie in $\{4, 6, 8\}$. Norms 4 and 6 do…
We extend the results of Ozeki on the configurations of extremal even unimodular lattices. Specifically, we show that if L is such a lattice of rank 56, 72, or 96, then L is generated by its minimal-norm vectors.
For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $\sqrt{s}\cdot L$ is isometric to a sublattice of $\mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$…
In this article we prove that integral lattices with minimum <= 7 (or <= 9) whose set of minimal vectors form spherical 9-designs (or 11-designs respectively) are extremal, even and unimodular. We furthermore show that there does not exist…
We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…
All indecomposable unimodular hermitian lattices in dimensions 14 and 15 over the ring of integers in $\mathbb{Q}(\sqrt{-3})$ are determined. Precisely one lattice in dimension 14 and two lattices in dimension 15 have minimal norm 3.
Pursuing ideas in a recent work of the second author, we determine the isometry classes of unimodular lattices of rank 28, as well as the isometry classes of unimodular lattices of rank 29 without nonzero vectors of norm <=2.
A modular form for an even lattice L of signature (2,n) is said to be 2-reflective if its zero divisor is set-theoretically contained in the Heegner divisor defined by the (-2)-vectors in L. We prove that there are only finitely many even…
We classify the unimodular Euclidean integral lattices of rank 29 by developing an elementary, yet very efficient, inductive method. As an application, we determine the isometry classes of even lattices of rank at most 28 and prime…
A lattice in the Euclidean space is standard if it has a basis consisting vectors whose norms equal to the length in its successive minima. In this paper, it is shown that with the $L^2$ norm all lattices of dimension $n$ are standard if…
By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…
A recent SICOMP paper on classical and quantum algorithms for the shortest vector problem introduced a lattice-dependent parameter \(\gamma(L)\), bounded universally in the exponential sense by \(2^{0.402n+o(n)}\), and conjectured that this…
We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
Let $L$ be an integral lattice in the Euclidean space $\mathbb{R}^n$ and $W$ an irreducible representation of the orthogonal group of $\mathbb{R}^n$. We give an implemented algorithm computing the dimension of the subspace of invariants in…