Disjoint covering systems of rational Beatty sequences

DOI10.1016/0012-365X(91)90293-BzbMath0742.11011MaRDI QIDQ5905461

R. Jamie Simpson

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90293-b

zbMATH Keywords

disjoint covering system; rational Beatty sequence

Mathematics Subject Classification ID

11B75: Other combinatorial number theory

11A07: Congruences; primitive roots; residue systems

11B83: Special sequences and polynomials

Related Items

Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups, Unnamed Item, A different approach to the Fraenkel Conjecture for low $n$ values, Equations on palindromes and circular words, Beatty sequences and Langford sequences, On a generalization of Christoffel words: epichristoffel words, Design of a multitask neurovision processor, Partitioning the positive integers to seven Beatty sequences, The complexity of functions on lattices, On balanced and abelian properties of circular words over a ternary alphabet, Do balanced words have a short period?, A contribution to infinite disjoint covering systems, Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture

Cites Work

• Unnamed Item
• A non-analytic proof of the Newman-Znám result for disjoint covering systems
• Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta: n=1,2,\dots \}\)]
• Complementing and exactly covering sequences
• Beatty Sequences, Continued Fractions, and Certain Shift Operators
• Spectra of Numbers
• The Bracket Function and Complementary Sets of Integers
• Disjoint covering systems of rational Beatty sequences