Pattern avoidance: themes and variations
From MaRDI portal
Publication:557911
DOI10.1016/j.tcs.2005.01.004zbMath1076.68051OpenAlexW1969770235MaRDI QIDQ557911
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.004
pattern avoidanceprobabilistic methodsmorphismwordcircular wordpattern avoidance in the abelian sense
Related Items (29)
Unary Patterns with Permutations ⋮ Exponential lower bounds for the number of words of uniform length avoiding a pattern ⋮ On the avoidability index of palindromes ⋮ Unary patterns under permutations ⋮ Computing Depths of Patterns ⋮ Thue choosability of trees ⋮ Extensions and reductions of squarefree words ⋮ Nonrepetitive colorings of graphs -- a survey ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Nonrepetitive colorings of line arrangements ⋮ New approach to nonrepetitive sequences ⋮ Nonrepetitive colouring via entropy compression ⋮ Pattern avoidance by palindromes ⋮ Every real number greater than 1 is a critical exponent ⋮ Grasshopper avoidance of patterns ⋮ Facial non-repetitive edge-coloring of plane graphs ⋮ Searching for Zimin patterns ⋮ Highly nonrepetitive sequences: Winning strategies from the local lemma ⋮ Nonrepetitive list colourings of paths ⋮ A cyclic binary morphism avoiding abelian fourth powers ⋮ The complexity of nonrepetitive coloring ⋮ Extremal square-free words ⋮ Square-free extensions of words ⋮ Density dichotomy in random words ⋮ On long words avoiding Zimin patterns ⋮ How to play Thue games ⋮ On a generalization of Thue sequences ⋮ A Frameless 2-Coloring of the Plane Lattice ⋮ Cubic patterns with permutations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial versus exponential growth in repetition-free binary words
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Growth problems for avoidable words
- The entropy of square-free words
- Arithmetic progressions in partially ordered sets
- Multidimensional unrepetitive configurations
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Enumeration of irreducible binary words
- Avoidable patterns in strings of symbols
- Strongly non-repetitive sequences and progression-free sets
- Sharp characterizations of squarefree morphisms
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Intervals in the lattice of varieties
- Overlap-free words and finite automata
- On Abelian squares and substitutions
- On repetition-free binary words of minimal density
- On the number of Abelian square-free words on four letters
- Non-repetitive tilings
- On cube-free \(\omega\)-words generated by binary morphisms
- Uniformly growing k-th power-free homomorphisms
- Thue-like sequences and rainbow arithmetic progressions
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Words strongly avoiding fractional powers
- Sur un théorème de Thue
- Characterization of the repetitive commutative semigroups
- Avoiding Patterns in the Abelian Sense
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- BLOCKING SETS OF TERMS
- A linear-time algorithm to decide whether a binary word contains an overlap
- ON REPRESENTATION SYSTEMS
- The Goulden—Jackson cluster method: extensions, applications and implementations
- Nonrepetitive colorings of graphs
- ALGORITHMIC PROBLEMS IN VARIETIES
- Abelian squares are avoidable on 4 letters
This page was built for publication: Pattern avoidance: themes and variations
