One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations
We prove connections between one-unknown word equations and three-unknown constant-free word equations, and use them to prove that the number of equations in an independent system of three-unknown constant-free equations is at most logarithmic with respect to the length of the shortest equation in the system. We also study two well-known conjectures. The first conjecture claims that there is a constant c such that every one-unknown equation has either infinitely many solutions or at most c. The second conjecture claims that there is a constant c such that every independent system of three-unknown constant-free equations with a nonperiodic solution is of size at most c. We prove that the first conjecture implies the second one, possibly for a different constant.
KeywordsCombinatorics on words Word equations Independent systems
- 10.Karhumäki, J., Plandowski, W.: On the defect effect of many identities in free semigroups. In: Paun, G. (ed.) Mathematical Aspects of Natural and Formal Languages, pp. 225–232. World Scientific (1994)Google Scholar
- 15.Spehner, J.C.: Quelques problémes d’extension, de conjugaison et de présentation des sous-monoïdes d’un monoïde libre. Ph.D. thesis, Univ. Paris (1976)Google Scholar
- 16.Spehner, J.C.: Les systemes entiers d’équations sur un alphabet de 3 variables. In: Semigroups, pp. 342–357 (1986)Google Scholar