SearcharxivSearch

arXiv · 2504.15456

Non-solutions to mixed equations in acylindrically hyperbolic groups coming from random walks

Abstract

A mixed equation in a group $G$ is given by a non-trivial element $w (x)$ of the free product $G \ast \mathbb{Z}$, and a solution is some $g\in G$ such that $w(g)$ is the identity. For $G$ acylindrically hyperbolic with trivial finite radical (e.g. torsion-free) we show that any mixed equation of length $n$ has a non-solution of length comparable to $\log(n)$, which is the best possible bound. Similarly, we show that there is a common non-solution of length $O(n)$ to all mixed equations of length $n$, again the best possible bound. In fact, in both cases we show that a random walk of appropriate length yields a non-solution with positive probability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Henry Bradford, Alessandro Sisto. 2025-04-21. Non-solutions to mixed equations in acylindrically hyperbolic groups coming from random walks. https://arxiv.org/abs/2504.15456

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