Related papers: The optimal lattice quantizer in nine dimensions
Bravais lattices are the most fundamental building blocks of crystallography. They are classified into groups according to their translational, rotational, and inversion symmetries. In computational analysis of Bravais lattices, fulfilment…
Knots are commonly found in molecular chains such as DNA and proteins, and they have been considered to be useful models for structural analysis of these molecules. One interested quantity is the minimum number of monomers necessary to…
We present a multi-phase design parameterization to obtain optimized heterogeneous lattice structures. The 3D domain is discretized into a cubical grid wherein each cube has eight distinct unit cell types or phases. When all phases are…
A lattice Delaunay polytope is known as perfect if the only ellipsoid, that can be circumscribed about it, is its Delaunay sphere. Perfect Delaunay polytopes are in one-to-one correspondence with arithmetic equivalence classes of positive…
Lattices are discrete mathematical objects with widespread applications to integer programs as well as modern cryptography. A fundamental problem in both domains is the Closest Vector Problem (popularly known as CVP). It is well-known that…
The parametric lattice-point counting problem is as follows: Given an integer matrix $A \in Z^{m \times n}$, compute an explicit formula parameterized by $b \in R^m$ that determines the number of integer points in the polyhedron $\{x \in…
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$.…
Properties of intervals in the lattice of antichains of subsets of a universe of finite size are investigated. New objects and quantities in this lattice are defined. Expressions and numerical values are deduced for the number of connected…
We investigate minimal-perimeter configurations of two finite sets of points on the square lattice. This corresponds to a lattice version of the classical double-bubble problem. We give a detailed description of the fine geometry of…
In this paper, we focus on finite Bravais lattice energies per point in two dimensions. We compute the first and second derivatives of these energies. We prove that the Hessian at the square and the triangular lattice are diagonal and we…
A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…
Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive…
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
We perform a tree-level O(a) improvement of two-dimensional N=(2,2) supersymmetric Yang-Mills theory on the lattice, motivated by the fast convergence in numerical simulations. The improvement respects an exact supersymmetry Q which is…
This educational article highlights the geometric and algebraic complexities that distinguish tensors from matrices, to supplement coverage in advanced courses on linear algebra, matrix analysis, and tensor decompositions. Using the case of…
We construct a torsion-free arithmetic lattice in $\mathrm{PGL}_2(\mathbb{F}_2(\!(t)\!))\times\mathrm{PGL}_2(\mathbb{F}_2(\!(t)\!))$ arising from a quaternion algebra over $\mathbb{F}_2(z)$. It is the fundamental group of a square complex…
We prove that the $E_8$ root lattice and the Leech lattice are universally optimal among point configurations in Euclidean spaces of dimensions $8$ and $24$, respectively. In other words, they minimize energy for every potential function…
The problem of communicating over the additive white Gaussian noise (AWGN) channel with lattice codes is addressed in this paper. Theoretically, Voronoi constellations have proved to yield very powerful lattice codes when the fine/coding…
Characterization of crystallographic lattices is an important tool in structure solution, crystallographic database searches and clustering of diffraction images in serial crystallography. Characterization of lattices by Niggli-reduced…
We consider the root lattice $A_n$ and derive explicit formulae for the moments of its Voronoi cell. We then show that these formulae enable accurate prediction of the error probability of lattice codes constructed from $A_n$.