Covering the positive integers by disjoint sets of the form \[n+]: n=1,2, \
From MaRDI portal
Publication:1394256
Cites work
- Complementing and exactly covering sequences
- scientific article; zbMATH DE number 3137476 (Why is no real title available?)
- scientific article; zbMATH DE number 3186999 (Why is no real title available?)
- On A Theorem of Uspensky
- On certain distributions of integers in pairs with given differences
- On exactly covering systems of arithmetic sequences
- On the sequence $[n \alpha]$, $n = 1,2,\dots$. Supplementary note to the preceding paper by Th. Skolem
- The Bracket Function and Complementary Sets of Integers
- Unions of arithmetic sequences
Cited in
(37)- On smooth sets of integers
- Balanced words and dynamical systems
- Balances for fixed points of primitive substitutions.
- Partitioning the positive integers to seven Beatty sequences
- Well-balanced sequences
- The complexity of functions on lattices
- Balance properties of multi-dimensional words
- Generalized balances in Sturmian words
- Substitution invariant Sturmian bisequences
- \(m\)-balanced words: A generalization of balanced words
- Lattice bounded distance equivalence for 1D Delone sets with finite local complexity
- On balanced sequences and their critical exponent
- On balanced and abelian properties of circular words over a ternary alphabet
- Transformations for pairwise well-formed modes
- Webster sequences, apportionment problems, and just-in-time sequencing
- Do balanced words have a short period?
- Natural exact covering systems and the reversion of the Möbius series
- A contribution to infinite disjoint covering systems
- Critical exponents of infinite balanced words
- Describing the set of words generated by interval exchange transformation
- Interspersions and Dispersions
- Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups
- On \(m\)-covering families of Beatty sequences with irrational moduli
- A new approach to the Fraenkel conjecture for low n values
- Balancing and clustering of words in the Burrows-Wheeler transform
- Rotation encoding and self-similarity phenomenon
- Disjoint covering systems of rational Beatty sequences
- Disjoint covering systems of rational Beatty sequences
- Abelian combinatorics on words: a survey
- An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
- New examples of words for which binomial complexities and subword complexity coincide
- On balance properties of hypercubic billiard words
- Hausdorff dimensions of Beatty multiplicative shifts
- Beatty sequences and Langford sequences
- A dynamical view of Tijdeman's solution of the chairman assignment problem
- Beatty sequences for a quadratic irrational: decidability and applications
- A geometric point of view on the synchronization of three Christoffel words
This page was built for publication: Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta]: n=1,2,\dots \}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1394256)