The weak circular repetition threshold over large alphabets

DOI10.1051/ita/2020006OpenAlexW3096259819MaRDI QIDQ5021102

Narad Rampersad, L. A. S. Mól

Publication date: 12 January 2022

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.11388

zbMATH Keywords

nonrepetitive colouringDejean's conjecturerepetition thresholdcircular repetition thresholdDejean's theoremrepetition threshold for graphs

Mathematics Subject Classification ID

Combinatorics on words (68R15) Coloring of graphs and hypergraphs (05C15)

Uses Software

• Walnut

Cites Work

• Unnamed Item
• Last cases of Dejean's conjecture
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Dejean's conjecture and Sturmian words
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Toeplitz words, generalized periodicity and periodically iterated morphisms
• There exist binary circular \(5/2^+\) power free words of every length
• On repetition thresholds of caterpillars and trees of bounded degree
• There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
• Repetition threshold for circular words
• Dejean's conjecture holds for \(n\geq 30\)
• Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
• On Dejean's conjecture over large alphabets
• Attainable lengths for circular binary words avoiding \(k\) powers
• Sur un théorème de Thue
• ON THE EXISTENCE OF MINIMAL β-POWERS
• Repetition thresholds for subdivided graphs and trees
• A proof of Dejean’s conjecture
• Dejean's conjecture holds for N ≥ 27
• Nonrepetitive colorings of graphs
• The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
• Planar graphs have bounded nonrepetitive chromatic number

This page was built for publication: The weak circular repetition threshold over large alphabets