Beatty sequences and Langford sequences (Q686460)

From MaRDI portal
Revision as of 10:09, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Beatty sequences and Langford sequences
scientific article

    Statements

    Beatty sequences and Langford sequences (English)
    0 references
    0 references
    0 references
    0 references
    26 June 1994
    0 references
    A disjoint covering system (DCS) of Beatty sequences is the collection of Beatty sequences \((\alpha_ i,\beta_ i)=\{\lfloor n_ i+ n_ i\rfloor: n\in{\mathbb{Z}}^ +\}\) with \(\alpha_ i>0\), \(\beta_ i\) real numbers, which partition \(\mathbb{Z}^ +\). If all the moduli \(\alpha_ i\) are integers then we obtain a system of arithmetic progressions covering \(\mathbb{Z}^ +\), so called integer DCS's. This fact provides an intuitive link between this notion and the Langford sequences \(C=\{c_ n\}_{n=1}^ \infty\) which are sequences defined by the property that for each of its elements \(c\in C\), the sequence \(\{n: c_ n=c\}\) is an infinite arithmetic progression with common difference \(c\). However, as the authors show, this link leads to a natural connection between Langford sequences and infinite integer DCS's with distinct moduli. To extend this relationship also to certain DCS's with rational moduli, the concept of a quasi-Langford sequence is introduced in the paper and these ties are used as the basis for proof of some properties of quasi- Langford sequences and vice versa. So for instance two conjectures on quasi-Langford sequences are formulated, their equivalence is proved and it is shown that they imply an older conjecture on DCS's with rational moduli.
    0 references
    disjoint covering system
    0 references
    Beatty sequences
    0 references
    arithmetic progressions
    0 references
    Langford sequences
    0 references
    quasi-Langford sequence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references