Indecomposable tilings of the integers with exponentially long periods (Q2571279)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Indecomposable tilings of the integers with exponentially long periods
scientific article

    Statements

    Indecomposable tilings of the integers with exponentially long periods (English)
    0 references
    1 November 2005
    0 references
    Let \(A\) be a finite multiset of integers. A second multiset of integers \(T\) is said to be an \(A\)-tiling of level \(d\) if every integer can be expressed in exactly \(d\) ways as the sum of an element of \(A\) and of an element of \(T\). It is known that all \(A\)-tilings of level \(d\) are periodic, see \textit{J. P. Steinberger} [J. Comb. Theory, Ser. A 106, 1--13 and erratum ibid. 107, 323--337 (2004; Zbl 1055.05026)]. This fact, as well as an upper bound for the period \((d+1)^{\text{diam}(A)}\), follows from the pigeonhole principle, where \(\text{diam}(A)\) is the difference of the maximum and minimum element of \(A\). Ruzsa and Kolountzakis have shown that there is an upper bound for the period independent of \(d\), which is near tight. Examples showing the tightness were decomposable, i.e. there were ways to write \(T\) as a disjoint union of two proper subsets that were also \(A\)-tilings. The present paper provides indecomposable examples for the near tightness.
    0 references
    additive bases
    0 references
    partition
    0 references
    multiset of integers
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references