Disjoint covering systems of rational Beatty sequences (Q5903072): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complementing and exactly covering sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta]: n=1,2,\dots \}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roots of unity and covering sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beatty Sequences, Continued Fractions, and Certain Shift Operators / rank
 
Normal rank

Latest revision as of 13:34, 17 June 2024

scientific article; zbMATH DE number 3946262
Language Label Description Also known as
English
Disjoint covering systems of rational Beatty sequences
scientific article; zbMATH DE number 3946262

    Statements

    Disjoint covering systems of rational Beatty sequences (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    A rational Beatty sequence is a set of integers of the form \([\alpha +nr]\) with n running over the set \({\mathbb{Z}}^+\) if nonnegative integers and \(\alpha\) a real and r a rational number with \(n\geq 1\). Here [ ] denotes the greatest integer function and r is called the modulus of the sequence. The authors prove that if a finite system of Beatty sequences partitions \({\mathbb{Z}}^+\) then the greatest among the numerators of the moduli (written in their lowest terms) of these sequences appears at least twice. This is a generalization of the well known result of Davenport, Mirsky, D. Newman and Rado for disjoint covering systems of arithmetic sequences. They also prove that even three largest numerators are equal provided the system contains at least three sequences and the moduli corresponding to these numerators are not equal.
    0 references
    0 references
    rational Beatty sequence
    0 references
    greatest integer function
    0 references
    disjoint covering systems
    0 references
    0 references