On the covering multiplicity of lattices (Q1193702): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5580319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering radius of the Leech lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5787302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Covering Sphere Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum sphere covering a convex polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modeling Language for Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Lie Algebras and Representation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice points in high-dimensional spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale linearly constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3030892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Voronoi Region of $E_7^*$ / rank
 
Normal rank

Latest revision as of 14:21, 16 May 2024

scientific article
Language Label Description Also known as
English
On the covering multiplicity of lattices
scientific article

    Statements

    On the covering multiplicity of lattices (English)
    0 references
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    Let \(\Lambda\) be a lattice with covering radius \(R\), so that closed balls of radius \(R\) just cover the space. The covering multiplicity \(CM(\Lambda)\) is the maximal number of times the interiors of these balls overlap. The authors show that the least possible covering multiplicity for an \(n\)-dimensional lattice is \(n\) if \(n\leq 8\) and conjecture that it exceeds \(n\) in all other cases. The authors determine \(CM(\Lambda)\) for some of the classical lattices.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lattice
    0 references
    covering multiplicity
    0 references
    0 references
    0 references
    0 references