Shrinking integer lattices (Q1896343): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q57925530, #quickstatements; #temporary_batch_1718109305272
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Robin J. Chapman / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jörg M. Wills / rank
Normal rank
 
Property / author
 
Property / author: Robin J. Chapman / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Jörg M. Wills / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shrinking integer lattices. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shrinking Lattice Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5774426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200153 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57925530 / rank
 
Normal rank

Latest revision as of 14:38, 11 June 2024

scientific article
Language Label Description Also known as
English
Shrinking integer lattices
scientific article

    Statements

    Shrinking integer lattices (English)
    0 references
    18 February 1996
    0 references
    Let \(\Lambda\) be a full sublattice of the integer lattice \(\mathbb{Z}^n\) in Euclidean \(n\)-space. The author then asks for the maximal \(r>0\) such that there is a sublattice \(\Lambda'\) of \(\mathbb{Z}^n\) isometric to \(r^{-1} \Lambda\). In 1990 \textit{J. Cremona} and \textit{S. Landau} [SIAM J. Discrete Math. 3, 338-348 (1990; Zbl 0711.51010)] gave an upper bound for \(r\) and showed that this bound is always attained if \(n\leq 4\). The author shows that this bound is also always attained for \(n=5\). He further gives counterexamples which show that the bound is not always attained for \(n=6\) or \(n\geq 8\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    full sublattice
    0 references
    integer lattice
    0 references
    0 references
    0 references