SearcharxivSearch

arXiv · 1406.4590

Local similarity groups with context-free co-word problem

Abstract

Let $G$ be a group, and let $S$ be a finite subset of $G$ that generates $G$ as a monoid. The co-word problem is the collection of words in the free monoid $S^{\ast}$ that represent non-trivial elements of $G$. 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 $V$ 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 $V$. Hughes introduced the class $\mathcal{FSS}$ of groups that are determined by finite similarity structures. An $\mathcal{FSS}$ group acts by local similarities on a compact ultrametric space. Thompson's group $V$ is a representative example, but there are many others. We show that $\mathcal{FSS}$ groups have context-free co-word problem under a minimal additional hypothesis. As a result, we can specify a subfamily of $\mathcal{FSS}$ groups that are potential counterexamples to the conjecture.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Farley. 2014-06-18. Local similarity groups with context-free co-word problem. https://arxiv.org/abs/1406.4590

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR