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 of integers where , let the {it gap sequence} of this set be the nondecreasing sequence where equals 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 and , there is a positive integer such that for all , the set of integers can be partitioned into -sets with gap sequence , .
Recommendations
Cites work
- Addition theorems for sets of integers
- Checker Boards and Polyominoes
- Decomposition of the line in isometric three-point sets
- scientific article; zbMATH DE number 3520315 (Why is no real title available?)
- scientific article; zbMATH DE number 687006 (Why is no real title available?)
- scientific article; zbMATH DE number 1507302 (Why is no real title available?)
- scientific article; zbMATH DE number 3057976 (Why is no real title available?)
- On the decomposition of the straight line in the congruent three-point sets
- One-dimensional tilings using tiles with two gap lengths
- Partitioning a cyclic group into well-dispersed subsets with a common gap sequence
- Some results on one-dimensional tilings
- Tilings in \(\mathbb{Z}\) with triples
- Tilings of lattice points in Euclidean n-space
Cited in
(4)
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)