Etude Algorithmique de Réseaux Construits avec la Forme Trace (Q5285861)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 223008
Language Label Description Also known as
default for all languages
No label defined
    English
    Etude Algorithmique de Réseaux Construits avec la Forme Trace
    scientific article; zbMATH DE number 223008

      Statements

      Etude Algorithmique de Réseaux Construits avec la Forme Trace (English)
      0 references
      0 references
      0 references
      29 June 1993
      0 references
      perfect lattices
      0 references
      eutactic lattices
      0 references
      cyclotomic fields
      0 references
      Leech lattice
      0 references
      calculation of minimum and minimal vectors
      0 references
      trace form
      0 references
      even unimodular lattices
      0 references
      Craig's lattices
      0 references
      The authors study the numerical properties of three types of lattices constructed by means of the trace form in cyclotomic number fields and: calculate their minimum and minimal vectors; determine whether or not they are perfect or eutactic. The lattices considered are: certain even unimodular lattices, constructed by \textit{E. Bayer-Fluckiger} [Comment. Math. Helv. 59, 509-538 (1984; Zbl 0558.10029)], of minimum 4 and dimension 24 (Leech lattice [\textit{J. H. Conway} and \textit{N. J. A. Sloane}, Sphere packings, lattices and groups (1988; Zbl 0634.52002), (2nd ed. 1993; Zbl 0785.11036)]), 32 and 48; certain lattices related to the Leech lattice; and Craig's lattices (ibid.), constructed using the successive powers of the ideal above \(p\) in the \(p\)-th cyclotomic field.
      0 references

      Identifiers