Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.13967

Growth and Language Complexity of Potentially Positive Elements of Free Groups

Emma Dinowitz·Lucy Koch-Hyde·Siobhan O'Connor·Eamonn Olive
View original source ↗Read source document ↗Export metadata ↓

Abstract

A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to give new bounds on the asymptotic growth of potentially positive elements in free groups of 2 to 7 generators. We prove the bounds for $F_2$ are tight, giving the growth function up to a constant multiplier. We use the same tools to show that certain restricted automata cannot recognize the set of potentially positive elements.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Emma Dinowitz, Lucy Koch-Hyde, Siobhan O'Connor, Eamonn Olive. 2025-12-16. Growth and Language Complexity of Potentially Positive Elements of Free Groups. https://arxiv.org/abs/2512.13967

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗