Related papers: Counting Co-Cyclic Lattices

We obtain explicit expressions for positive integer moments of the probability density of eigenvalues of the Jacobi and Laguerre random matrix ensembles, in the asymptotic regime of large dimension. These densities are closely related to…

An asymptotic formula is presented for the number of planar lattice convex polygonal lines joining the origin to a distant point of the diagonal. The formula involves the non-trivial zeros of the zeta function and leads to a necessary and…

The problem of finding short vectors in Euclidean lattices is a central hard problem in complexity theory. The case of module lattices (i.e., lattices which are also modules over a number ring) is of particular interest for cryptography and…

We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…

We prove the following result: Let K be a lattice, let D be a distributive lattice with zero, and let $\phi$: Con K $\to$ D be a {∨, 0}-homomorphism, where Conc K denotes the {∨, 0}-semilattice of all finitely generated…

We prove that for any free lattice F with at least $\aleph\_2$ generators in any non-distributive variety of lattices, there exists no sectionally complemented lattice L with congruence lattice isomorphic to the one of F. This solves a…

A classical result of R.\,P. Dilworth states that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice~$L$. A~sharper form was published in G.~Gr\"atzer and E.\,T. Schmidt in 1962, adding…

In 1908, Voronoi introduced an algorithm that solves the lattice packing problem in any dimension in finite time. Voronoi showed that any lattice with optimal packing density must be a so-called perfect lattice, and his algorithm enumerates…

It is shown that, given any (n-1)-dimensional lattice L, there is a vector v in Z^n such that the projection of Z^n onto v^perp is arbitrarily close to L. The problem arises in attempting to find the largest cylinder anchored at two points…

Let $\Sigma$ be the Davis complex for a Coxeter system (W,S). The automorphism group G of $\Sigma$ is naturally a locally compact group, and a simple combinatorial condition due to Haglund--Paulin determines when G is nondiscrete. The…

In this paper, for any integer $k\geq 2$, we study the distribution of the visible lattice points in certain generalized P\'{o}lya's walk on $\mathbb{Z}^k$: perturbed P\'{o}lya's walk and twisted P\'{o}lya's walk. For the first case, we…

Suppose V is a surface over a number field k that admits two elliptic fibrations. We show that for each integer d there exists an explicitly computable closed subset Z of V, not equal to V, such that for each field extension K of k of…

Triangulations are important objects of study in combinatorics, finite element simulations and quantum gravity, where its entropy is crucial for many physical properties. Due to their inherent complex topological structure even the number…

We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…

We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e.,…

Elliptic Dedekind sums were introduced by R. Sczech as generalizations of classical Dedekind sums to complex lattices. We show that for any lattice with real $j$-invariant, the values of suitably normalized elliptic Dedekind sums are dense…

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…

The celebrated Smith-Minkowski-Siegel mass formula expresses the mass of a quadratic lattice (L, Q) as a product of local factors, called the local densities of (L,Q). This mass formula is an essential tool for the classification of…

In 1960, G. Gr\"atzer and E.\,T. Schmidt proved that every finite distributive lattice can be represented as the congruence lattice of a sectionally complemented finite lattice $L$. For $u \leq v$ in $L$, they constructed a sectional…

We study the existence of nontrivial and of representable (dual) weak complementations, along with the lattice congruences that preserve them, in different constructions of bounded lattices, then use this study to determine the finite…