There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
From MaRDI portal
Publication:1856341
zbMath1057.68081MaRDI QIDQ1856341
Publication date: 13 May 2003
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/124300
Combinatorics on words (68R15) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Other designs, configurations (05B30) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items (32)
On the facial Thue choice number of plane graphs via entropy compression method ⋮ On the entropy and letter frequencies of powerfree words ⋮ Lengths of extremal square-free ternary words. ⋮ Nonrepetitive colorings of trees ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Some results in square-free and strong square-free edge-colorings of graphs ⋮ New bounds for facial nonrepetitive colouring ⋮ Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture ⋮ Thue choosability of trees ⋮ On the facial Thue choice index of plane graphs ⋮ Fractional Thue chromatic number of graphs ⋮ Nonrepetitive colorings of graphs -- a survey ⋮ Avoiding abelian powers cyclically ⋮ Nonrepetitive vertex colorings of graphs ⋮ Thue type problems for graphs, points, and numbers ⋮ Distinct Squares in Circular Words ⋮ On repetition thresholds of caterpillars and trees of bounded degree ⋮ Anagram-free graph colouring ⋮ Breaking the rhythm on graphs ⋮ Nonrepetitive colouring via entropy compression ⋮ The Thue-Morse word contains circular \(5/2^+\) power free words of every length ⋮ Pattern avoidance: themes and variations ⋮ Border correlations of partial words ⋮ Facial non-repetitive edge-coloring of plane graphs ⋮ Nonrepetitive list colourings of paths ⋮ Nonrepetitive colorings of graphs ⋮ Cyclically repetition-free words on small alphabets ⋮ Facial Nonrepetitive Vertex Coloring of Plane Graphs ⋮ Total Thue colourings of graphs ⋮ On a generalization of Thue sequences ⋮ The weak circular repetition threshold over large alphabets
This page was built for publication: There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
