2 papers
math.CO2025
Complexity and recurrence in infinite words and related structures
Be'eri Greenfeld, Carlos Gustavo Moreira, Efim Zelmanov
We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recu…
math.DS2024
On the complexity of subshifts and infinite words
Be'eri Greenfeld, Carlos Gustavo Moreira, Efim Zelmanov
We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and gro…