A powerful abelian square-free substitution over 4 letters
From MaRDI portal
Publication:837181
DOI10.1016/J.TCS.2009.05.027zbMATH Open1172.68035OpenAlexW2022723708MaRDI QIDQ837181FDOQ837181
Authors: Veikko Keränen 
Publication date: 10 September 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.027
Recommendations
- Abelian squares are avoidable on 4 letters
- On Abelian squares and substitutions
- On the number of Abelian square-free words on four letters
- scientific article; zbMATH DE number 2051154
- Publication:4351078
- Avoidability of Additive Cubes over Alphabets of Four Numbers
- Avoiding Abelian squares in partial words
- Power-substitution and cancellation in the class of Abelian groups
- On shortest crucial words avoiding abelian powers
Cites Work
- Second Preimage Attacks on Dithered Hash Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sharp characterizations of squarefree morphisms
- Title not available (Why is that?)
- Strongly non-repetitive sequences and progression-free sets
- Title not available (Why is that?)
- Abelian squares are avoidable on 4 letters
- Title not available (Why is that?)
- A cyclic binary morphism avoiding abelian fourth powers
- On uniformly repetitive semigroups
- On nonrepetitive sequences
- On Abelian squares and substitutions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the number of Abelian square-free words on four letters
- ON ABELIAN POWER-FREE MORPHISMS
- Title not available (Why is that?)
- Words strongly avoiding fractional powers
- Title not available (Why is that?)
- The number of binary words avoiding Abelian fourth powers grows exponentially
- Partially abelian squarefree words
- A characterization of power-free morphisms
- Some results on \(k\)-power-free morphisms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Abelian repetitions in partial words
- Algorithmic combinatorics on partial words
- Title not available (Why is that?)
- Avoiding or limiting regularities in words
- ON ABELIAN POWER-FREE MORPHISMS
- Anagram-Free Colorings of Graph Subdivisions
- Abelian squares are avoidable on 4 letters
- \(2\times n\) grids have unbounded anagram-free chromatic number
- Avoiding Abelian squares in partial words
- Anagram-free graph colouring
- On Abelian repetition threshold
- Avoiding abelian powers cyclically
- Abelian combinatorics on words: a survey
- On a conjecture of Erdős
This page was built for publication: A powerful abelian square-free substitution over 4 letters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837181)
