Autostackability of Thompson's group F

DOI10.1016/J.JALGEBRA.2019.04.004MaRDI QIDQ2282986zbMATH OpenOpenAlexWikidataFDO

Authors Nathan Corwin, Gili Golan, Ashley Johnson, Zoran Šunić, Susan Hermiller

Publication date 27 December 2019

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1811.11691

zbMATH Keywords

Thompson's groupword problemfinite state automatarewriting systemautomatic groupautostackable

Mathematics Subject Classification ID

Geometric group theory (20F65) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Abstract: The word problem for Thompson's group $F$ has a solution, but it remains unknown whether $F$ is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group $F$ admits a natural extension of these two properties, namely autostackability, and we give an explicit bounded regular convergent prefix-rewriting system for $F$.

Recommendations

• Homology and closure properties of autostackable groups
• Thompson's group F is 1-counter graph automatic.
• The conjugacy problem in extensions of Thompson's group \(F\)
• scientific article; zbMATH DE number 1054134
• The automorphism group of Thompson's group \(F\): subgroups and metric properties.

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• scientific article; zbMATH DE number 1054134 (Why is no real title available?)
• scientific article; zbMATH DE number 1822302 (Why is no real title available?)
• scientific article; zbMATH DE number 1405695 (Why is no real title available?)
• Algorithms and topology of Cayley graphs for groups.
• An infinite-dimensional torsion-free \(\text{FP}_{\infty}\) group
• Combinatorial group theory.
• Determining solubility for finitely generated groups of PL homeomorphisms
• Diagram groups
• On subgroups of R. Thompson's group \(F\)
• On the stabilizers of finite sets of numbers in the R. Thompson group \(F\)
• Tame combing and almost convexity conditions.
• The Dehn function of Richard Thompson's group \(F\) is quadratic.
• The conjugacy problem in extensions of Thompson's group \(F\)
• The simultaneous conjugacy problem in groups of piecewise linear functions.
• Thompson's group \(F\) is 1-counter graph automatic.

Cited in

(5)

• The conjugacy problem in extensions of Thompson's group \(F\)
• Thompson's group \(F\) is 1-counter graph automatic.
• Homology and closure properties of autostackable groups
• Automorphisms of generalized Thompson groups
• HNN extensions and stackable groups

This page was built for publication: Autostackability of Thompson's group \(F\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282986)