English

Quaternionic lattices and poly-context-free word problem

Group Theory 2024-02-13 v1

Abstract

A finitely generated group GG is called poly-context-free if its word problem WP(G)\mathrm{WP}(G) is an intersection of finitely many context-free languages. We consider the quaternionic lattices Γτ\Gamma_\tau over the field Fq(t)\mathbb{F}_{q}(t) constructed by Stix-Vdovina (2017), and prove that they are not poly-context-free. As a corollary, since all the groups Γτ\Gamma_{\tau} are quasi-isometric to F2×F2F_2\times F_2, 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(Γτ)abcd\mathrm{WP}(\Gamma_\tau)\cap a^*b^*c^*d^*, which relies on the existence of anti-tori and certain power-type endomorphisms of the groups Γτ\Gamma_\tau.

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

R2 v1 2026-06-28T14:45:45.931Z