Polyboxes, cube tilings and rigidity

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…