Score: 0

Word equations and the exponent of periodicity

Published: November 11, 2025 | arXiv ID: 2511.08208v1

By: Volker Diekert, Silas Natterer, Alexander Thumm

Potential Business Impact:

Finds patterns in word puzzles with rules.

Business Areas:
Primary Education Education

In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in the broader framework of word equations with regular constraints and establish new positive results: the conjecture holds for all quadratic word equations with constraints in finite semigroups from the variety $\mathbf{DLG}$ and its left-right dual $\mathbf{DRG}$, encompassing, in particular, all finite groups, commutative semigroups, and $\mathcal{J}$-trivial semigroups.

Country of Origin
🇩🇪 Germany

Page Count
23 pages

Category
Computer Science:
Formal Languages and Automata Theory