Polyboxes, cube tilings and rigidity

dc.creatorKisielewicz, Andrzej P.
dc.creatorPrzesławski, Krzysztof
dc.date2006-09-05
dc.date2006-10-23
dc.date.accessioned2026-07-07T07:24:31Z
dc.date.available2026-07-07T07:24:31Z
dc.descriptionA 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_i\setminus B_i, A_i is different from each of the sets B_i, X_i\setminus 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 \bigcup F = \bigcup G implies F = G. As an application, the rigidity conjecture for 2-extremal cube tilings of Lagarias and Shor is verified.
dc.description27 pages
dc.identifierhttps://arxiv.org/abs/math/0609132
dc.identifierhttp://arxiv.org/abs/math/0609132
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116384
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subject52C22; 05B45
dc.titlePolyboxes, cube tilings and rigidity
dc.typetext

Files

Collections