Quaternionic lattices and poly-context-free word problem
Quaternionic lattices and poly-context-free word problem
A finitely generated group $G$ is called poly-context-free if its word problem $\mathrm{WP}(G)$ is an intersection of finitely many context-free languages. We consider the quaternionic lattices $\Gamma_\tau$ over the field $\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}$ …