Related papers: A Note on Optimal Unimodular Lattices

An even unimodular 72-dimensional lattice $\Gamma $ having minimum 8 is constructed as a tensor product of the Barnes lattice and the Leech lattice over the ring of integers in the imaginary quadratic number field with discriminant $-7$.…

An algorithm is presented for generating finite modular, semimodular, graded, and geometric lattices up to isomorphism. Isomorphic copies are avoided using a combination of the general-purpose graph-isomorphism tool nauty and some…

In this paper, new extremal odd unimodular lattices in dimension $36$ are constructed. Some new odd unimodular lattices in dimension $36$ with long shadows are also constructed.

Odd, positive-definite, integral, unimodular lattices N of rank 24 were classified by Borcherds. There are 273 isometry classes of such lattices. Associated to them are vertex superalgebras $V_N$ of central charge c=24. We show that at…

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…

For some extremal (optimal) odd unimodular lattice $L$ in dimensions $12,16,20,28,32,36,40$ and $44$, we determine all integers $k$ such that $L$ contains a $k$-frame. This result yields the existence of an extremal Type I…

For some extremal (optimal) odd unimodular lattices L in dimensions n=12,16,20,32,36,40 and 44, we determine all positive integers k such that L contains a k-frame. This result yields the existence of an extremal Type I Zk-code of lengths…

We show that there is a unique extremal even unimodular lattice of dimension 48 which has an automorphism of order 5 of type 5-(8,16)-8. Since the three known extremal lattices do not admit such an automorphism, this provides a new example…

We establish an upper bound on the number of real multiquadratic fields that admit a universal quadratic lattice of a given rank, or contain a given amount of indecomposable elements modulo totally positive units, obtaining density zero…

We prove an explicit asymptotic formula for the logarithm of the minimal ranks of $n$-universal lattices over the ring of integers of totally real number fields. We also show that, for any constant $C > 0$ and $n \geq 3$, there are only…

We classify the three-dimensional lattice polytopes with two interior lattice points. Up to unimodular equivalence there are 22,673,449 such polytopes. This classification allows us to verify, for this case only, a conjectural upper bound…

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$…

A recent line of work on lattice codes for Gaussian wiretap channels introduced a new lattice invariant called secrecy gain as a code design criterion which captures the confusion that lattice coding produces at an eavesdropper. Following…

A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…

Self-dual codes over F5 exist for all even lengths. The smallest length for which the largest minimum weight among self-dual codes has not been determined is 24, and the largest minimum weight is either 9 or 10. In this note, we show that…

We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.

In this paper, we consider integral maximal lattice-free simplices. Such simplices have integer vertices and contain integer points in the relative interior of each of their facets, but no integer point is allowed in the full interior. In…

We study the smallest, as well as the largest numbers of congruences of lattices of an arbitrary finite cardinality $n$. Continuing the work of Freese and Cz\' edli, we prove that the third, fourth and fifth largest numbers of congruences…

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…

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…