Local similarity groups with context-free co-word problem
Daniel Farley

TL;DR
This paper investigates the co-word problem in groups, focusing on the class of $ ext{FSS}$ groups, and shows they generally have a context-free co-word problem, contributing to understanding the conjecture about Thompson's group $V$.
Contribution
It proves that $ ext{FSS}$ groups have a context-free co-word problem under minimal conditions, identifying potential counterexamples to the conjecture about $V$.
Findings
$ ext{FSS}$ groups have a context-free co-word problem under certain conditions
Identifies a subfamily of $ ext{FSS}$ groups that may counter the conjecture
Supports the conjecture that $V$ is universal for groups with a context-free co-word problem
Abstract
Let be a group, and let be a finite subset of that generates as a monoid. The co-word problem is the collection of words in the free monoid that represent non-trivial elements of . A current conjecture, based originally on a conjecture of Lehnert and modified into its current form by Bleak, Matucci, and Neuh\"{o}ffer, says that Thompson's group is a universal group with context-free co-word problem. In other words, it is conjectured that a group has a context-free co-word problem exactly if it is a finitely generated subgroup of . Hughes introduced the class of groups that are determined by finite similarity structures. An group acts by local similarities on a compact ultrametric space. Thompson's group is a representative example, but there are many others. We show that groups have…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Spam and Phishing Detection
