Disjoint covering systems of rational Beatty sequences
From MaRDI portal
Publication:5905461
DOI10.1016/0012-365X(91)90293-BzbMath0742.11011OpenAlexW2139337670MaRDI QIDQ5905461
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
Other combinatorial number theory (11B75) Congruences; primitive roots; residue systems (11A07) Special sequences and polynomials (11B83)
Related Items (13)
On a generalization of Christoffel words: epichristoffel words ⋮ A different approach to the Fraenkel Conjecture for low $n$ values ⋮ A contribution to infinite disjoint covering systems ⋮ Partitioning the positive integers to seven Beatty sequences ⋮ Beatty sequences and Langford sequences ⋮ Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups ⋮ Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture ⋮ Equations on palindromes and circular words ⋮ Unnamed Item ⋮ Do balanced words have a short period? ⋮ The complexity of functions on lattices ⋮ On balanced and abelian properties of circular words over a ternary alphabet ⋮ Design of a multitask neurovision processor
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
This page was built for publication: Disjoint covering systems of rational Beatty sequences