Quaternionic lattices and poly-context-free word problem
Abstract
A finitely generated group G is called poly-context-free if its word problem WP(G) is an intersection of finitely many context-free languages. We consider the quaternionic lattices τ over the field Fq(t) constructed by Stix-Vdovina (2017), and prove that they are not poly-context-free. As a corollary, since all the groups τ are quasi-isometric to F2× F2, the class of groups with poly-context-free word problem is not closed under quasi-isometries. The result follows from the description of the language WP(τ) a*b*c*d*, which relies on the existence of anti-tori and certain power-type endomorphisms of the groups τ.
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.