The falsification by fellow traveler property implies geodesic autostackability

2022/09/24 by DeClerk, Ash
#20F10 (Primary) 68Q42 (Secondary) #20F65 #FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.2209.11912

Abstract

Groups with the falsification by fellow traveler property are known to have solvable word problem, but they are not known to be automatic or to have finite convergent rewriting systems. In this paper, we show that these groups admit a generalization of the two properties; namely, they are geodesically autostackable. As a key part of proving this, we show that a wider class of groups, namely groups with a weight non-increasing synchronously regular convergent prefix-rewriting system, have a bounded regular convergent prefix-rewriting system.

Related

• Autostackability of Thompson's group F
• Homology and closure properties of autostackable groups
• Algorithms and topology for Cayley graphs of groups
• Rewriting systems, plain groups, and geodetic graphs
• On groups presented by inverse-closed finite convergent length-reducing\n rewriting systems