There exist binary circular \(5/2^+\) power free words of every length
From MaRDI portal
Publication:1422153
zbMath1058.68084MaRDI QIDQ1422153
Publication date: 5 February 2004
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/Volume_11/Abstracts/v11i1r10.html
Related Items (11)
Fractional meanings of nonrepetitiveness ⋮ Repetition thresholds for subdivided graphs and trees ⋮ Infinite ternary square-free words concatenated from permutations of a single word ⋮ Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture ⋮ Square-free words with square-free self-shuffles ⋮ Avoiding abelian powers cyclically ⋮ On repetition thresholds of caterpillars and trees of bounded degree ⋮ There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) ⋮ Growth of repetition-free words -- a review ⋮ Circular critical exponents for Thue–Morse factors ⋮ The weak circular repetition threshold over large alphabets
This page was built for publication: There exist binary circular \(5/2^+\) power free words of every length
