The descending chain condition on solution sets for systems of equations in groups
- 1 February 1986
- journal article
- research article
- Published by Cambridge University Press (CUP) in Proceedings of the Edinburgh Mathematical Society
- Vol. 29 (1) , 69-73
- https://doi.org/10.1017/s0013091500017429
Abstract
The Ehrenfeucht Conjecture [5] states that if Μ is a finitely generated free monoid with nonempty subset S, then there is a finite subset T⊂S (a “test set”) such that given two endomorphisms f and g on Μ, f and g agree on S if and only if they agree on T. In[4], the authors prove that the above conjecture is equivalent to the following conjecture: a system of equations in a finite number of unknowns in Μ is equivalent to a finite subsystem. Since a finitely generated free monoid embeds naturally into the free group with the same number of generators, it is natural to ask whether a free group of finite rank has the above property on systems of equations. A restatement of the question motivates the following.Keywords
This publication has 8 references indexed in Scilit:
- Combinatorial Group TheoryPublished by Springer Nature ,2001
- Systems of equations over a free monoid and Ehrenfeucht's conjectureDiscrete Mathematics, 1983
- On fixed points of automorphisms of finitely generated free groupsBulletin of the American Mathematical Society, 1983
- Test sets and checking words for homomorphism equivalenceJournal of Computer and System Sciences, 1980
- Equations in groupsBulletin of the Brazilian Mathematical Society, New Series, 1980
- On systems of equations in free groupsSiberian Mathematical Journal, 1973
- Residually Free GroupsProceedings of the London Mathematical Society, 1967
- Some two-generator one-relator non-Hopfian groupsBulletin of the American Mathematical Society, 1962