SearcharxivSearch

arXiv · 1705.01492

Piecewise excluding geodesic languages

Abstract

The complexity of a geodesic language has connections to algebraic properties of the group. Gilman, Hermiller, Holt, and Rees show that a finitely generated group is virtually free if and only if its geodesic language is locally excluding for some finite inverse-closed generating set. The existence of such a correspondence and the result of Hermiller, Holt, and Rees that finitely generated abelian groups have piecewise excluding geodesic language for all finite inverse-closed generating sets motivated our work. We show that a finitely generated group with piecewise excluding geodesic language need not be abelian and give a class of infinite non-abelian groups which have piecewise excluding geodesic languages for certain generating sets. The quaternion group is shown to be the only non-abelian 2-generator group with piecewise excluding geodesic language for all finite inverse-closed generating sets. We also show that there are virtually abelian groups with geodesic languages which are not piecewise excluding for any finite inverse-closed generating set.

Explore related subjects

Keep this discovery

BibTeXRIS

Maranda Franke. 2017-05-03. Piecewise excluding geodesic languages. https://arxiv.org/abs/1705.01492

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