SearcharxivSearch

arXiv · 2603.28953

A language-theoretic approach to study the density of subsets in free groups

Abstract

In this paper, we study the density of subsets of nonabelian free groups using relative densities of languages. We start by proving some basic properties about the density of a language $L_1$ relative to another language $L_2$ containing $L_1$. We then focus on the case where $L_2$ is the language of freely reduced words over an alphabet and prove an analogue of the Infinite Monkey Theorem for this language. This result, obtained as a corollary of a broader theorem on irreducible subshifts of finite type, allows for a language-theoretic characterization of rational subsets with positive density. As a consequence, we obtain a language-theoretic proof that the automorphic orbit of an element of a nonabelian free group has natural density zero, which generalizes a result by Burillo and Ventura concerning the density of primitive elements of free groups. We then describe rational subsets of free groups of positive density and explore in depth the case of finitely generated subgroups. We prove that if the rational subset is a subgroup, then it has positive density if and only if it has finite index and characterize those for which there is convergence. In cases where convergence fails due to parity constraints, we show that the density of the subset always exhibits weak convergence and that the average of its supremum and infimum densities converges to the expected value.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

André Carvalho. 2026-03-30. A language-theoretic approach to study the density of subsets in free groups. https://arxiv.org/abs/2603.28953

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