Abelian squares are avoidable on 4 letters
From MaRDI portal
Publication:5204304
DOI10.1007/3-540-55719-9_62zbMath1425.68331OpenAlexW1537696453MaRDI QIDQ5204304
Publication date: 4 December 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55719-9_62
Related Items (56)
Abelian-square-rich words ⋮ Maximal abelian square-free words of short length. ⋮ Branching frequency and Markov entropy of repetition-free languages ⋮ A powerful abelian square-free substitution over 4 letters ⋮ Words with the Maximum Number of Abelian Squares ⋮ On the structure and extendibility of \(k\)-power free words ⋮ Anagram-Free Colourings of Graphs ⋮ Long binary patterns are abelian 2-avoidable ⋮ Maximum number of distinct and nonequivalent nonstandard squares in a word ⋮ New second-preimage attacks on hash functions ⋮ Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ The complexity of unavoidable word patterns ⋮ On Growth and Fluctuation of k-Abelian Complexity ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ On growth and fluctuation of \(k\)-abelian complexity ⋮ The number of binary words avoiding Abelian fourth powers grows exponentially ⋮ \(2\times n\) grids have unbounded anagram-free chromatic number ⋮ Crucial words and the complexity of some extremal problems for sets of prohibited words ⋮ The undirected repetition threshold and undirected pattern avoidance ⋮ On the number of Abelian square-free words on four letters ⋮ On a generalization of abelian equivalence and complexity of infinite words ⋮ Infinite ternary square-free words concatenated from permutations of a single word ⋮ Anagram-free colorings of graphs ⋮ Approaching repetition thresholds via local resampling and entropy compression ⋮ Abelian combinatorics on words: a survey ⋮ Fixed points avoiding abelian \(k\)-powers ⋮ On the 2-binomial complexity of the generalized Thue-Morse words ⋮ New second preimage attacks on dithered hash functions with low memory complexity ⋮ Avoiding or Limiting Regularities in Words ⋮ Avoiding Abelian squares in partial words ⋮ Abelian repetitions in partial words ⋮ Avoiding abelian powers cyclically ⋮ Words strongly avoiding fractional powers ⋮ On highly palindromic words: the \(n\)-ary case ⋮ Thue type problems for graphs, points, and numbers ⋮ On some generalizations of abelian power avoidability ⋮ Abelian closures of infinite binary words ⋮ Weak abelian periodicity of infinite words ⋮ Relations on words ⋮ An abelian periodicity lemma ⋮ Anagram-free graph colouring ⋮ On \(k\)-abelian palindromes ⋮ Avoiding 2-binomial squares and cubes ⋮ Growth of repetition-free words -- a review ⋮ Avoidability of long 𝑘-abelian repetitions ⋮ Pattern avoidance: themes and variations ⋮ Problems in between words and abelian words: \(k\)-abelian avoidability ⋮ Anagram-Free Colorings of Graph Subdivisions ⋮ On factor graphs of DOL words ⋮ Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$ ⋮ On Abelian squares and substitutions ⋮ Repetitive perhaps, but certainly not boring ⋮ Mesosome avoidance ⋮ Abelian repetition threshold revisited ⋮ On a generalization of Thue sequences ⋮ A non-learnable class of E-pattern languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of power-free morphisms
- Strongly non-repetitive sequences and progression-free sets
- Sharp characterizations of squarefree morphisms
- On nonrepetitive sequences
- Partially abelian squarefree words
This page was built for publication: Abelian squares are avoidable on 4 letters
