The Diophantine problem in Thompson's group F
classification
🧮 math.GR
keywords
diophantineproblemabelianisationgroupthompsonundecidableusesarguments
read the original abstract
We show that the Diophantine problem in Thompson's group F is undecidable. Our proof uses the facts that F has finite commutator width and rank 2 abelianisation, then uses similar arguments used by B\"uchi and Senger and Ciobanu and Garreta to show the Diophantine problem in free groups and monoids with abelianisation constraints is undecidable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.