# On abelian versions of critical factorization theorem

@article{Avgustinovich2012OnAV,
title={On abelian versions of critical factorization theorem},
author={Sergey V. Avgustinovich and Juhani Karhum{\"a}ki and Svetlana Puzynina},
journal={RAIRO Theor. Informatics Appl.},
year={2012},
volume={46},
pages={3-15}
}
• Published 2012
• Mathematics
• RAIRO Theor. Informatics Appl.
In the paper we study abelian versions of the critical factorization theorem. We investigate both similarities and differences between the abelian powers and the usual powers. The results we obtained show that the constraints for abelian powers implying periodicity should be quite strong, but still natural analogies exist.
Abelian Properties of Words
A short overview of some directions of research on abelian properties of words is given, and two new problems are discussed in more detail: small abelia complexity of two-dimensional words, and abelians subshifts.
Weak Abelian Periodicity of Infinite Words
• Mathematics
Theory of Computing Systems
• 2015
This paper establishes necessary and sufficient conditions for the weak abelian periodicity of fixed points of uniform binary morphisms, and considers its relation with the notions of balance and letter frequency, and study operations preserving weak abeilic periodicity.
Abelian Combinatorics on Words: a Survey
• Mathematics
ArXiv
• 2022
We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of combinatorics on
Abelian returns in Sturmian words
• Mathematics
WORDS
• 2011
It is proved that a word is Sturmian if and only if each of its factors has two or three abelian returns.
Aperiodic Two-Dimensional Words of Small Abelian Complexity
It is proved that if a two-dimensional recurrent word contains at most two abelian factors for each pair (n,m) of integers, then it has a periodicity vector and it is shown that aTwo-dimensional aperiodic recurrent word must have more than two abelsian factors infinitely often.
Abelian powers and repetitions in Sturmian
• Mathematics
• 2016
Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79–95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent k for every k > 0. We improve on this result by
ABELIAN POWERS AND IN STURMIAN WORDS
• Mathematics
• 2016
. Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79–95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent k for every k > 0. We improve on this result
Abelian bordered factors and periodicity
• Mathematics
Eur. J. Comb.
• 2016
Dyck Words, Lattice Paths, and Abelian Borders
• Mathematics
AFL
• 2017
A formula for the exact number of binary words of a given length with a given minimal abelian border length is derived, tightening a bound on that number from Christodoulakis et al. (Discrete Applied Mathematics, 2014).
Local Squares, Periodicity and Finite Automata
• Mathematics
Rainbow of Computer Science
• 2011
Nine variants of the problem when local regularity implies the global one in the setting where the existence of a square of certain length in every position of an infinite word are considered, and an amazing unavoidable result for 2-abelian squares is obtained.

## References

SHOWING 1-10 OF 18 REFERENCES
Words Avoiding Abelian Inclusions
• Mathematics, Philosophy
J. Autom. Lang. Comb.
• 2002
It is proved that cl- inclusions are unavoidable, but c-inclusions are avoidable for an arbitrary constant c.
Abelian complexity of minimal subshifts
• Mathematics
J. Lond. Math. Soc.
• 2011
An affirmative answer to an old question of Rauzy is given by exhibiting a class of words whose Abelian complexity is everywhere equal to 3 by using van der Waerden's theorem, which shows that any minimal subshift having bounded Abelian simplicity contains Abelian k-powers for every positive integer k.
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity
• Mathematics
Int. J. Found. Comput. Sci.
• 2011
The existence of uniformly recurrent binary words, having bounded Abelian complexity, which admit an infinite number of suffixes which do not begin in an Abelian square is shown.
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms
• Mathematics
Eur. J. Comb.
• 1997
We consider so-called Toeplitz words which can be viewed as generalizations of one-way infinite periodic words. We compute their subword complexity, and show that they can always be generated by
Periodicity and the Golden Ratio
• Mathematics
Theor. Comput. Sci.
• 1998
Algebraic Combinatorics on Words
1. Finite and infinite words J. Berstel and D. Perrin 2. Sturmian words J. Berstel and P. Seebold 3. Unavoidable patterns J. Cassaigne 4. Sesquipowers A. De Luca and S. Varricchio 5. The plactic
Locally Periodic Versus Globally Periodic Infinite Words
• Mathematics
J. Comb. Theory, Ser. A
• 2002
It is shown that each (2,4)- repetitive word is ultimately periodic, as well as that there exist continuum many, and hence also nonultimately periodic, ( 2, 5)-repetitive words.