Multiple tilings by cubes with no shared faces (Q790820): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Über Gitter konstanter Dichte / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über einfache und mehrfache Bedeckung des \(n\)-dimensionalen Raumes mit einem Würfelgitter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über lückenlose Ausfüllung des \(n\)-dimensionalen Raumes durch kongruente Würfel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple tilings of \(n\)-dimensional space by unit cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Tiling / rank
 
Normal rank

Latest revision as of 11:15, 14 June 2024

scientific article
Language Label Description Also known as
English
Multiple tilings by cubes with no shared faces
scientific article

    Statements

    Multiple tilings by cubes with no shared faces (English)
    0 references
    0 references
    1982
    0 references
    In analogy to a famous conjecture by Minkowski and the equally famous affirmative answer by \textit{G. Hajós} [Math. Fiz. Lapok 48, 37-64 (1941; Zbl 0025.02902)] it as asked whether, for a given pair \((k,n)\) of positive integers, we can find, in any \(k\)-fold tiling of the Euclidean space \(R^ n\) by translates of the unit cube, a pair of cubes which share an \((n-1)\)-dimensional face. By an explicit construction, based on earlier work of \textit{G. Hajós} [Mat. Fiz. Lapok 45, 171-190 (1938; Zbl 0020.00604)] and \textit{R. Robinson} [Math. Z. 166, 225-264 (1979; Zbl 0398.52006)], the author gives a negative answer to this question, for all \((k,n)\) with \(k\geq 2\) and \(n\geq 3\).
    0 references
    lattice cube tilings
    0 references
    hypercube
    0 references
    \(k\)-fold tiling
    0 references

    Identifiers

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