Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers
From MaRDI portal
Publication:6654113
DOI10.1137/23M1558513MaRDI QIDQ6654113
James D. Currie, Jeffrey Shallit, Narad Rampersad, L. A. S. Mól
Publication date: 18 December 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed points avoiding abelian \(k\)-powers
- Last cases of Dejean's conjecture
- The number of binary words avoiding Abelian fourth powers grows exponentially
- Branching frequency and Markov entropy of repetition-free languages
- Growth rates of complexity of power-free languages
- Strongly non-repetitive sequences and progression-free sets
- Critical exponents of infinite balanced words
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- On minimal critical exponent of balanced sequences
- On Abelian repetition threshold
- A proof of Dejean’s conjecture
- Avoiding Three Consecutive Blocks of the Same Size and Same Sum
- Automatic Sequences
- Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$
- Avoidability of Additive Cubes over Alphabets of Four Numbers
- The Logical Approach to Automatic Sequences
- The repetition threshold for binary rich words
- Abelian squares are avoidable on 4 letters
- The repetition threshold of episturmian sequences
This page was built for publication: Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654113)