Autostackability of Thompson's group F

DOI10.1016/J.JALGEBRA.2019.04.004zbMATH Open1485.20080arXiv1811.11691OpenAlexW2903480888WikidataQ128061763 ScholiaQ128061763MaRDI QIDQ2282986FDOQ2282986

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)

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$.

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

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.

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)

Cites Work

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

Cited In (5)

• Automorphisms of generalized Thompson groups
• Thompson's group \(F\) is 1-counter graph automatic.
• The conjugacy problem in extensions of Thompson's group \(F\)
• Homology and closure properties of autostackable 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)