Skip to main navigation Skip to search Skip to main content

The Diophantine problem in Thompson’s group F

Research output: Contribution to journal › Article › peer-review

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üchi and Senger [Z. Math. Logik Grundlag. Math. 34 (1988), pp. 337–342] and Ciobanu and Garreta [Int. Math. Res. Not. IMRN 5 (2024), pp. 4119–4159] to show the Diophantine problem in free groups and monoids with abelianisation constraints is undecidable.

Original languageEnglish
Pages (from-to)2013-2023
Number of pages11
JournalMathematics of Computation
Volume95
Issue number360
DOIs
Publication statusPublished - 9 Jun 2025

Keywords

  • equations in groups
  • Thompson’s group F

Cite this