Related papers: The optimal lattice quantizer in nine dimensions
Certain types of neurons, called "grid cells", have been shown to fire on a triangular grid when an animal is navigating on a two-dimensional environment, whereas recent studies suggest that the face-centred-cubic (FCC) lattice is the good…
We consider a two-dimensional analogue of Jacobi theta functions and prove that, among all lattices $\Lambda \subset \mathbb{R}^2$ with fixed density, the minimal value is maximized by the hexagonal lattice. This result can be interpreted…
The domain wall fermion formalism in lattice gauge theory is much investigated recently. This is set up by reducing 4+1 dimensional theory to low energy effective 4 dimensional one. In order to look around other possibilities of realizing…
We propose a class of auxetic three-dimensional lattice structures. The elastic microstructure can be designed in order to have omni-directional Poisson's ratio arbitrarily close to the stability limit -1. The cubic behavior of the periodic…
In this paper, we classify the perfect lattices in dimension 8. There are 10916 of them. Our classification heavily relies on exploiting symmetry in polyhedral computations. Here we describe algorithms making the classification possible.
This paper is concerned with the maximisation of the k'th eigenvalue of the Laplacian amongst flat tori of unit volume in dimension d as k goes to infinity. We show that in any dimension maximisers exist for any given k, but that any…
We propose a unified mathematical framework for classifying phases of matter. The framework is based on different types of combinatorial structures with a notion of locality called lattices. A tensor lattice is a local prescription that…
We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…
In a recent paper, the authors have proved that for lattices A and B with zero, the isomorphism $Conc(A \otimes B)\cong Conc A \otimes Conc B$, holds, provided that the tensor product satisfies a very natural condition (of being…
Quantum spin-lattice systems in low dimensions exhibit a variety of interesting zero-temperature phases, some of which show non-classical (i.e., non-magnetic) long-range orders, such as dimer or trimer valence-bond order. These…
A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…
In this review we discuss the general features of maximally twisted lattice QCD. In particular, we illustrate how automatic O(a) improvement can be achieved and how it is possible to set up a lattice regularization scheme where the problem…
In the framework of the so called link approach we study exact lattice supersymmetry for the simplest supersymmetric model: N=1 supersymmetry in D=1. The model is described by a lattice with spacing a/2, thus containing twice as many sites…
We consider Zador's asymptotic formula for the distortion-rate function for a variable-rate vector quantizer in the high-rate case. This formula involves the differential entropy of the source, the rate of the quantizer in bits per sample,…
Let $E$ be a directed (i.e., positively generated) ordered vector space endowed with an inner product. In this note, we prove that the following statements are equivalent: i) $E$ is a vector lattice and its norm induced by its inner product…
The lattice $A_n^*$ is an important lattice because of its covering properties in low dimensions. Clarkson \cite{Clarkson1999:Anstar} described an algorithm to compute the nearest lattice point in $A_n^*$ that requires $O(n\log{n})$…
Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been…
Heavy-meson semileptonic decays calculations on the lattice are reviewed. The focus is upon obtaining reliable matrix elements. Errors that depend upon the lattice spacing, $a$, are an important source of systematic error. Full $O(a)$…
We prove that the very simple lattices which consist of a largest, a smallest and $2n$ pairwise incomparable elements where $n$ is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…