Presents sufficient conditions extending Dekking's result for abelian k-power-free morphisms over binary alphabets, a sieve technique for the template method, and examples of morphisms with abelian power-free fixed points stronger than the morphisms themselves.
Thue, Uber unendliche zeichenreihen, Christiana Videnskabs Selskabs Skrifter 7 (1906)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Box Progressions, Abelian Power-Free Morphisms and A Sieve Technique for the Template Method
Presents sufficient conditions extending Dekking's result for abelian k-power-free morphisms over binary alphabets, a sieve technique for the template method, and examples of morphisms with abelian power-free fixed points stronger than the morphisms themselves.