Keller’s cube-tiling conjecture is false in high dimensions

DOI10.1090/S0273-0979-1992-00318-XMaRDI QIDQ4020147zbMATH OpenOpenAlexWikidataFDO

Authors Jeffrey C. Lagarias, Peter W. Shor

Publication date 16 January 1993

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9210222

zbMATH Keywords

tilingscubescliques in graphs

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Lattice packing and covering (number-theoretic aspects) (11H31)

Abstract: O. H. Keller conjectured in 1930 that in any tiling of $Bbb{R}^n$ by unit $n$-cubes there exist two of them having a complete facet in common. O. Perron proved this conjecture for $nle6$. We show that for all $nge10$ there exists a tiling of $Bbb{R}^n$ by unit $n$-cubes such that no two $n$-cubes have a complete facet in common.

Recommendations

• A cube tiling of dimension eight with no facesharing
• Multiple tilings of Euclidean space by unit cubes
• Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes
• A combinatorial approach for Keller's conjecture
• Cube tilings as contributions of algebra to geometry

Cites work

• A combinatorial approach for Keller's conjecture
• A reduction of Keller's conjecture
• Algebraic Tiling
• Über einfache und mehrfache Bedeckung des \(n\)-dimensionalen Raumes mit einem Würfelgitter
• Über lückenlose Ausfüllung des \(n\)-dimensionalen Raumes durch kongruente Würfel

Cited in

(51)

• Enumerating cube tilings
• Structure results for multiple tilings in 3D
• Partitions and balanced matchings of an n-dimensional cube
• On Keller's conjecture in dimension seven
• Wavelets, tiling, and spectral sets
• The maximum clique problem
• Spectra for cubes in products of finite cyclic groups
• Multiple tilings by cubes with no shared faces
• Cube packings, second moment and holes
• The structure of cube tilings under symmetry conditions
• A counterexample to the periodic tiling conjecture
• Polyboxes, cube tilings and rigidity
• On flipping edge sets in unique sink orientations
• Spectrum is periodic for \(n\)-intervals
• Rigidity and the chessboard theorem for cube packings
• Rigid polyboxes and Keller's conjecture
• Towards resolving Keller's cube tiling conjecture in dimension seven
• Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes
• What is known about unit cubes
• A note on Gabor orthonormal bases
• On the structure of cube tilings and unextendible systems of cubes in low dimensions
• Tiling \(\mathbb R^5\) by crosses
• scientific article; zbMATH DE number 7793076 (Why is no real title available?)
• A cube tiling of dimension eight with no facesharing
• Cube tilings with linear constraints
• Spectral pairs in Cartesian coordinates
• Orthonormal bases of exponentials for the n-cube
• Gluing and cutting cube tiling codes in dimension six
• Distinguishability of complete and unextendible product bases
• Filling space with hypercubes of two sizes – The pythagorean tiling in higher dimensions
• Varieties of mathematical understanding
• Orthogonal Fourier analysis on domains
• The resolution of Keller's conjecture
• The resolution of Keller's conjecture
• On hypercube packings, blocking sets and a covering problem
• Extended Keller graph and its properties
• Test case generators and computational results for the maximum clique problem
• An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning
• Spectral sets and factorizations of finite abelian groups
• New results on torus cube packings and tilings
• Keller's conjecture revisited
• The structure of cube tilings
• Depth-first simplicial partition for copositivity detection, with an application to MaxClique
• Keller properties for integer tilings
• Isospectral measures
• On the structure of cube tiling codes
• Degree of recurrence of generic diffeomorphisms
• Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses
• On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
• On the number of neighbors in normal tiling
• Multiple factorizations of cyclic groups

This page was built for publication: Keller’s cube-tiling conjecture is false in high dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020147)