Generalized Beatty sequences and complementary triples
Publication:2332793
DOI10.2140/MOSCOW.2019.8.325zbMath1455.11042arXiv1809.03424OpenAlexW3101743286WikidataQ127149688 ScholiaQ127149688MaRDI QIDQ2332793
Jean-Paul Allouche, F. Michel Dekking
Publication date: 5 November 2019
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.03424
return wordsmorphic wordscomplementary pairs and triplesgeneralized Beatty sequencesKimberling transform
Combinatorics on words (68R15) Quadratic and bilinear Diophantine equations (11D09) Continued fractions and generalizations (11J70) Special sequences and polynomials (11B83) Automata sequences (11B85)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Beyond odious and evil
- The sequence of return words of the Fibonacci sequence
- A two-parameter family of an extension of Beatty sequences
- Generalized Beatty sequences
- A simple characterization of Sturm numbers
- Substitution invariant cutting sequences
- The Frobenius problem for homomorphic embeddings of languages into the integers
- On complementary triples of Sturmian bisequences
- On certain distributions of integers in pairs with given differences
- Morphisms, Symbolic sequences, and their Standard Forms
- From Enmity to Amity
- Sequences with minimal block growth II
- Minimal symbolic flows having minimal block growth
- Complementary Systems of Integers
- Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups
- Automatic Sequences
- Slow Beatty Sequences, Devious Convergence, and Partitional Divergence
- Substitution invariant Sturmian words and binary trees
- Complementary Iterated Floor Words and the Flora Game
- Inverse and Complementary Sequences of Natural Numbers
- Some properties of the singular words of the Fibonacci word
This page was built for publication: Generalized Beatty sequences and complementary triples