Quaternionic lattices and poly-context-free word problem
Group Theory
2024-02-13 v1
Abstract
A finitely generated group is called poly-context-free if its word problem is an intersection of finitely many context-free languages. We consider the quaternionic lattices over the field 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 , 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 , which relies on the existence of anti-tori and certain power-type endomorphisms of the groups .
Keywords
Cite
@article{arxiv.2402.07494,
title = {Quaternionic lattices and poly-context-free word problem},
author = {Ievgen Bondarenko},
journal= {arXiv preprint arXiv:2402.07494},
year = {2024}
}
Comments
10 pages