On the construction of dense lattices with a given automorphisms group (Q2372823): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4039225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hlawka's theorem in the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence theorems in the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on packing density / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement to the Minkowski‐Hiawka bound for packing superballs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2732621 / rank
 
Normal rank

Latest revision as of 13:05, 26 June 2024

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
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    lattice packing
    0 references
    Minkowski-Hlawka lower bound
    0 references
    probability
    0 references
    automorphism group
    0 references
    double circulant codes
    0 references
    0 references
    0 references