Word equations and the exponent of periodicity
Volker Diekert, Silas Natterer, Alexander Thumm

TL;DR
This paper investigates the relationship between the existence of infinitely many solutions to word equations and the presence of solutions with arbitrarily large periodicity, providing new results for specific classes of equations.
Contribution
It proves the conjecture holds for quadratic word equations with constraints in certain finite semigroups, expanding understanding in algebraic word equation solutions.
Findings
The conjecture is valid for quadratic equations in finite semigroups from $ extbf{DLG}$ and $ extbf{DRG}$.
Results encompass all finite groups, commutative semigroups, and $ extbf{J}$-trivial semigroups.
New positive results support the conjecture in broader algebraic contexts.
Abstract
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 and its left-right dual , encompassing, in particular, all finite groups, commutative semigroups, and -trivial semigroups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Geometric and Algebraic Topology · Formal Methods in Verification
