A powerful abelian square-free substitution over 4 letters
From MaRDI portal
(Redirected from Publication:837181)
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
- scientific article; zbMATH DE number 2186883 (Why is no real title available?)
- scientific article; zbMATH DE number 1809720 (Why is no real title available?)
- scientific article; zbMATH DE number 3162927 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3911729 (Why is no real title available?)
- scientific article; zbMATH DE number 3932412 (Why is no real title available?)
- scientific article; zbMATH DE number 3975229 (Why is no real title available?)
- scientific article; zbMATH DE number 3767067 (Why is no real title available?)
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 2051154 (Why is no real title available?)
- scientific article; zbMATH DE number 3995996 (Why is no real title available?)
- scientific article; zbMATH DE number 3246281 (Why is no real title available?)
- scientific article; zbMATH DE number 3375509 (Why is no real title available?)
- A characterization of power-free morphisms
- A cyclic binary morphism avoiding abelian fourth powers
- Abelian squares are avoidable on 4 letters
- ON ABELIAN POWER-FREE MORPHISMS
- On Abelian squares and substitutions
- On nonrepetitive sequences
- On the number of Abelian square-free words on four letters
- On uniformly repetitive semigroups
- Partially abelian squarefree words
- Second Preimage Attacks on Dithered Hash Functions
- Sharp characterizations of squarefree morphisms
- Some results on k-power-free morphisms
- Strongly non-repetitive sequences and progression-free sets
- The number of binary words avoiding Abelian fourth powers grows exponentially
- Words strongly avoiding fractional powers
Cited in
(14)- On a conjecture of Erdős
- Abelian repetitions in partial words
- Abelian combinatorics on words: a survey
- Algorithmic combinatorics on partial words
- scientific article; zbMATH DE number 2051154 (Why is no real title available?)
- 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
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)