Keller’s cube-tiling conjecture is false in high dimensions
DOI10.1090/S0273-0979-1992-00318-XzbMATH Open0759.52013arXivmath/9210222OpenAlexW2069098301WikidataQ55919309 ScholiaQ55919309MaRDI QIDQ4020147FDOQ4020147
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
Recommendations
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)
Cites Work
Cited In (48)
- 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
- Spectra for cubes in products of finite cyclic groups
- Wavelets, tiling, and spectral sets
- The maximum clique problem
- Multiple tilings by cubes with no shared faces
- Cube packings, second moment and holes
- The structure of cube tilings under symmetry conditions
- Polyboxes, cube tilings and rigidity
- On the Number of Neighbors in Normal Tiling
- Spectrum is periodic for \(n\)-intervals
- Rigid polyboxes and Keller's conjecture
- Rigidity and the chessboard theorem for cube packings
- Towards resolving Keller's cube tiling conjecture in dimension seven
- Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes
- A note on Gabor orthonormal bases
- What is known about unit cubes
- Title not available (Why is that?)
- Tiling \(\mathbb R^5\) by crosses
- On the structure of cube tilings and unextendible systems of cubes in low dimensions
- Cube tilings with linear constraints
- Keller's Conjecture Revisited
- A cube tiling of dimension eight with no facesharing
- Spectral pairs in Cartesian coordinates
- Title not available (Why is that?)
- 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
- 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
- An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning
- Test case generators and computational results for the maximum clique problem
- Spectral sets and factorizations of finite abelian groups
- New results on torus cube packings and tilings
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- Keller properties for integer tilings
- Degree of recurrence of generic diffeomorphisms
- On the structure of cube tiling codes
- Isospectral measures
- 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
- 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)