Highly nonrepetitive sequences: Winning strategies from the local lemma
From MaRDI portal
Publication:3068764
DOI10.1002/rsa.20354zbMath1213.68479arXiv1010.5772OpenAlexW2012494262WikidataQ124806037 ScholiaQ124806037MaRDI QIDQ3068764
Publication date: 17 January 2011
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.5772
Related Items
Improved upper bound for generalized acyclic chromatic number of graphs ⋮ A note on Thue games ⋮ On the Facial Thue Choice Index via Entropy Compression ⋮ Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters ⋮ New approach to nonrepetitive sequences ⋮ Nonrepetitive colouring via entropy compression ⋮ Nonrepetitive list colourings of paths ⋮ A Local Lemma for Focused Stochastic Algorithms ⋮ How to play Thue games ⋮ The lefthanded local lemma characterizes chordal dependency graphs
Cites Work
- Last cases of Dejean's conjecture
- Pattern avoidance: themes and variations
- Dejean's conjecture and Sturmian words
- Pattern avoidance on graphs
- Thue type problems for graphs, points, and numbers
- Avoidable patterns in strings of symbols
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Thue-like sequences and rainbow arithmetic progressions
- Dejean's conjecture holds for \(n\geq 30\)
- Exponential lower bounds for the number of words of uniform length avoiding a pattern
- On Dejean's conjecture over large alphabets
- A proof of Dejean’s conjecture
- Two Erdős problems on lacunary sequences: Chromatic number and Diophantine approximation
- BLOCKING SETS OF TERMS
