Automaticity for graphs of groups

Abstract

In this article we construct asynchronous and sometimes synchronous automatic structures for amalgamated products and HNN extensions of groups that are strongly asynchronously (or synchronously) coset automatic with respect to the associated automatic subgroups, subject to further geometric conditions. These results are proved in the general context of fundamental groups of graphs of groups. The hypotheses of our closure results are satisfied in a variety of examples such as Artin groups of sufficiently large type, Coxeter groups, virtually abelian groups, and groups that are hyperbolic relative to virtually abelian subgroups.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…