On the construction of dense lattices with a given automorphisms group (Q2372823)

From MaRDI portal
Revision as of 18:09, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On the construction of dense lattices with a given automorphisms group
scientific article

    Statements

    On the construction of dense lattices with a given automorphisms group (English)
    0 references
    0 references
    0 references
    1 August 2007
    0 references
    The main result of this article is the construction of a family of lattices for large enough primes \(q\) in dimensions \(n=2q\) with density at least \(c\,n/2^n\), where \(c\) is an absolute constant, and whose automorphism group contains a subgroup isomorphic to \(\mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}/q \mathbb{Z}\). Up to the constant \(c\), this density is of the same order as the best known density for lattice packings. The complexity of the construction a lattice is of order \(\exp(n \log n)\), which improves the known orders for such a density. The technique used here relies on the Construction A by Leech and Sloane and consists in picking a double circulant code and lifting it to a lattice. Evidence are given that a constant proportion of these codes give rise to lattices that achieve the aforementioned lower bound on the density.
    0 references
    lattice packing
    0 references
    Minkowski-Hlawka lower bound
    0 references
    probability
    0 references
    automorphism group
    0 references
    double circulant codes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references