English

Mapped Exponent and Asymptotic Critical Exponent of Words

Combinatorics 2025-06-06 v2 Formal Languages and Automata Theory

Abstract

We study how much injective morphisms can increase the repetitiveness of a given word. This question has a few possible variations depending on the meaning of ``repetitiveness''. We concentrate on fractional exponents of finite words and asymptotic critical exponents of infinite words. We characterize finite words that, when mapped by injective morphisms, can have arbitrarily high fractional exponent. For infinite words, alongside other results, we show that the asymptotic critical exponent grows at most by a constant factor (depending on the size of the alphabet) when mapped by an injective morphism. For both finite and infinite words, the binary case is better understood than the general case.

Keywords

Cite

@article{arxiv.2506.04091,
  title  = {Mapped Exponent and Asymptotic Critical Exponent of Words},
  author = {Eva Foster and Aleksi Saarela and Aleksi Vanhatalo},
  journal= {arXiv preprint arXiv:2506.04091},
  year   = {2025}
}