Polyboxes, cube tilings and rigidity
Andrzej P. Kisielewicz, Krzysztof Przesławski
Abstract
A non-empty subset A of X = X1 x...x Xd is a (proper) box if A = A1 x...x Ad and Ai is a (proper) subset of Xi 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: Ai = Bi, Ai = Xi Bi, Ai is different from each of the sets Bi, Xi Bi. 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 F = G implies F = G. As an application, the rigidity conjecture for 2-extremal cube tilings of Lagarias and Shor is verified.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.