The Coin Exchange Problem and the Structure of Cube Tilings

dc.creatorKisielewicz, Andrzej P.
dc.creatorPrzesławski, Krzysztof
dc.date2008-07-06
dc.date.accessioned2026-07-07T09:48:43Z
dc.date.available2026-07-07T09:48:43Z
dc.descriptionLet 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.
dc.description3 pages
dc.identifierhttps://arxiv.org/abs/0807.0891
dc.identifierhttp://arxiv.org/abs/0807.0891
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/164319
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.subject05A18, 52C22, 05B45, 11H99
dc.titleThe Coin Exchange Problem and the Structure of Cube Tilings
dc.typetext

Files

Collections