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