Polyboxes, cube tilings and rigidity

DOI10.1007/S00454-007-9005-2MaRDI QIDQ946683zbMATH OpenOpenAlexFDO

Authors Andrzej Kisielewicz, Krzysztof Przesławski

Publication date 24 September 2008

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

boxindexrigiditygenomebinary codeadditive mappingwordcube tilingdichotomous boxespolybox

Mathematics Subject Classification ID

Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Abstract: A non-empty subset A of X = X_1 x...x X_d is a (proper) box if A = A_1 x...x A_d and A_i is a (proper) subset of X_i for each i. Suppose that for each pair of boxes A, B and each i, one can only know which of the three states takes place: A_i = B_i, A_i = X_isetminus B_i, A_i is different from each of the sets B_i, X_isetminus B_i. Let F and G be two systems of disjoint boxes. Can one decide whether their unions are equal? In general, the answer is no, but as is shown in the paper, it is yes if both systems consist of pairwise dichotomous boxes. Several criteria that enable to compare such systems are collected. The paper includes also rigidity results, which say what assumptions have to be imposed on F to ensure that �igcup F = �igcup G implies F = G. As an application, the rigidity conjecture for 2-extremal cube tilings of Lagarias and Shor is verified.

Recommendations

• Rigid polyboxes and Keller's conjecture
• When can you tile a box with translates of two given rectangular bricks?
• Rigidity and the chessboard theorem for cube packings
• Partitions and balanced matchings of an n-dimensional cube
• On the structure of cube tilings and unextendible systems of cubes in low dimensions

Cites work

• scientific article; zbMATH DE number 752601 (Why is no real title available?)
• A cube tiling of dimension eight with no facesharing
• Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes
• Finite algebras of finite complexity
• Keller’s cube-tiling conjecture is false in high dimensions
• Minimal partitions of a box into boxes
• On partitions of discrete boxes
• Rigidity and the chessboard theorem for cube packings
• Über lückenlose Ausfüllung des \(n\)-dimensionalen Raumes durch kongruente Würfel
• Über lückenlose Ausfüllung des \(n\)-dimensionalen Raumes durch kongruente Würfel. II

Cited in

(18)

• New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)
• scientific article; zbMATH DE number 1101444 (Why is no real title available?)
• Rigid pentagons in hypercubes
• Partitions and balanced matchings of an n-dimensional cube
• On Keller's conjecture in dimension seven
• The structure of cube tilings under symmetry conditions
• Partition problems in high dimensional boxes
• The coin exchange problem and the structure of cube tilings
• Rigidity and the chessboard theorem for cube packings
• Rigid polyboxes and Keller's conjecture
• Towards resolving Keller's cube tiling conjecture in dimension seven
• Gluing and cutting cube tiling codes in dimension six
• Brick partition problems in three dimensions
• On the number of neighborly simplices in \(\mathbb{R}^d\)
• Irreducible subcube partitions
• On the structure of cube tiling codes
• A note on a flip-connected class of generalized domino tilings of the box \([0,2]^n\)
• On the number of neighbors in normal tiling

This page was built for publication: Polyboxes, cube tilings and rigidity

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