arXiv Analytics

Sign in

arXiv:0807.0891 [math.CO]AbstractReferencesReviewsResources

The Coin Exchange Problem and the Structure of Cube Tilings

Andrzej P. Kisielewicz, Krzysztof Przesławski

Published 2008-07-06Version 1

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.

Related articles: Most relevant | Search more
arXiv:0706.2282 [math.CO] (Published 2007-06-15)
Partition Identities and the Coin Exchange Problem
arXiv:1411.2314 [math.CO] (Published 2014-11-10)
A characterization of functions with vanishing averages over products of disjoint sets
arXiv:1002.1492 [math.CO] (Published 2010-02-07)
Books vs Triangles