The coin exchange problem and the structure of cube tilings

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Combinatorial aspects of packing and covering (05B40) Combinatorial aspects of tessellation and tiling problems (05B45) Lattices and convex bodies (number-theoretic aspects) (11H06) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Abstract: Let k_1,...,k_d be positive integers, and D be a subset of [k_1]x...x[k_d], whose complement can be decomposed into disjoint sets of the form {x_1}x...x{x_{s-1}}x[k_s]x{x_{s+1}}x...x{x_d}. We conjecture that the number of elements of D can be represented as a linear combination of the numbers k_1,..., k_d with non-negative integer coefficients. A connexion of this conjecture with the structure of periodical cube tilings is revealed.

Review text

Summary: It is shown that if \([0,1)^d+t\), \(t\in T\), is a unit cube tiling of \(\mathbb{R}^d\), then for every \(x\in T\), \(y\in \mathbb{R}^d\), and every positive integer \(m\) the number \(|T\cap (x+\mathbb{Z}^d)\cap([0,m)^d+ y)|\) is divisible by \(m\). Furthermore, by a result of \textit{D. Coppersmith} and \textit{J. Steinberger} [Integers 6, Paper A26, 28 p. (2006; Zbl 1109.11017)] on cyclotomic arrays, it is proven that for every finite discrete box \(D=D_1\times\cdots\times D_d \subseteq x+\mathbb{Z}^d\) of size \(m_1\times \cdots\times m_d\) the number \(|D\cap T|\) is a linear combination of \(m_1,\ldots, m_d\) with non-negative integer coefficients. Several consequences are collected. A generalization is presented.

Recommendations

Cited in

(1)

A note on a flip-connected class of generalized domino tilings of the box \([0,2]^n\)

This page was built for publication: The coin exchange problem and the structure of cube tilings

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