On tiling the integers with 4-sets of the same gap sequence

From MaRDI portal



Abstract: Partitioning a set into similar, if not, identical, parts is a fundamental research topic in combinatorics. The question of partitioning the integers in various ways has been considered throughout history. Given a set x1,ldots,xn of integers where x1<cdots<xn, let the {it gap sequence} of this set be the nondecreasing sequence d1,ldots,dn−1 where d1,ldots,dn−1 equals xi+1−xi:iin1,ldots,n−1 as a multiset. This paper addresses the following question, which was explicitly asked by Nakamigawa: can the set of integers be partitioned into sets with the same gap sequence? The question is known to be true for any set where the gap sequence has length at most two. This paper provides evidence that the question is true when the gap sequence has length three. Namely, we prove that given positive integers p and q, there is a positive integer r0 such that for all rgeqr0, the set of integers can be partitioned into 4-sets with gap sequence p,q, r.











This page was built for publication: On tiling the integers with 4-sets of the same gap sequence

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