SearcharxivSearch

arXiv · 2304.09144

Probabilistic Laws on Infinite Groups

Abstract

We study the probability that certain laws are satisfied on infinite groups, focusing on elements sampled by random walks. For several group laws, including the metabelian one, we construct examples of infinite groups for which the law holds with high probability, but the group does not satisfy the law virtually. On the other hand, we show that if an infinite group satisfies the law $x^2=1$ with positive probability, then it is virtually abelian.

Explore related subjects

Keep this discovery

BibTeXRIS

Gideon Amir, Guy Blachar, Maria Gerasimova, Gady Kozma. 2023-04-18. Probabilistic Laws on Infinite Groups. https://arxiv.org/abs/2304.09144

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