Groups with context-free co-word problem and embeddings into Thompson's group V

DOI10.1017/9781108526203.003MaRDI QIDQ5216932zbMATH OpenOpenAlexFDO

Authors Rose Berns-Zieve, Dana Fry, Johnny Gillings, Hannah Hoganson, Heather Mathews

Publication date 20 February 2020

Published in Topological Methods in Group Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1407.7745

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65) Formal languages and automata (68Q45)

Abstract: Let $G$ be a finitely generated group, and let $Sigma$ be a finite subset that generates $G$ as a monoid. The emph{word problem of $G$ with respect to $Sigma$} consists of all words in the free monoid $Sigm{a}^{ast}$ that are equal to the identity in $G$. The emph{co-word problem of $G$ with respect to $Sigma$} is the complement in $Sigm{a}^{ast}$ of the word problem. We say that a group $G$ is emph{co$mathcalCF$} if its co-word problem with respect to some (equivalently, any) finite generating set $Sigma$ is a context-free language. We describe a generalized Thompson group $V_{(G,heta)}$ for each finite group G and homomorphism $heta$: $GightarrowG$. Our group is constructed using the cloning systems introduced by Witzel and Zaremsky. We prove that $V_{(G,heta)}$ is co$mathcalCF$ for any homomorphism $heta$ and finite group G by constructing a pushdown automaton and showing that the co-word problem of $V_{(G,heta)}$ is the cyclic shift of the language accepted by our automaton. A version of a conjecture due to Lehnert says that a group has context-free co-word problem exactly if it is a finitely generated subgroup of V. The groups $V_{(G,heta)}$ where $heta$ is not the identity homomorphism do not appear to have obvious embeddings into V, and may therefore be considered possible counterexamples to the conjecture. Demonstrative subgroups of $V$, which were introduced by Bleak and Salazar-Diaz, can be used to construct embeddings of certain wreath products and amalgamated free products into $V$. We extend the class of known finitely generated demonstrative subgroups of V to include all virtually cyclic groups.

Recommendations

• A dynamical definition of f.g. virtually free groups
• Free products in R. Thompson's group V.
• Embeddings into Thompson's group \(V\) and \(\mathrm{co}\mathcal{C}{F}\) groups
• Local similarity groups with context-free co-word problem
• The co-word problem for the Higman-Thompson group is context-free

Cited in

(6)

• A dynamical definition of f.g. virtually free groups
• Embeddings into Thompson's group \(V\) and \(\mathrm{co}\mathcal{C}{F}\) groups
• GROUPS WITH INDEXED CO-WORD PROBLEM
• Classification of Thompson related groups arising from Jones' technology II
• Local similarity groups with context-free co-word problem
• The co-word problem for the Higman-Thompson group is context-free

This page was built for publication: Groups with context-free co-word problem and embeddings into Thompson's group \(V\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216932)