SearcharxivSearch

arXiv · math/0601050

$\Out(F_n)$ and the spectral gap conjecture

Abstract

For $n>2$, given $ϕ_1,...,ϕ_n$ randomly chosen isometries of $S^2$, it is well-known that the group $\G$ generated by $ϕ_1,...,ϕ_n$ acts ergodically on $S^2$. It is conjectured in \cite{GJS} that for almost every choice of $ϕ_1,...,ϕ_n$ this action is {\em strongly ergodic}. This is equivalent to the spectrum of $ϕ_1+ϕ_1{\inv}+{...}+ϕ_n+ϕ_n^{\inv}$ as an operator on $L^2(S^2)$ having a spectral gap, i.e. all eigenvalues but the largest one being bounded above by some $λ_1<2n$. (The largest eigenvalue $λ_0$, corresponding to constant functions, is $2n$.) In this article we show that if $n>2$, then either the conjecture is true or almost every $n$-tuple fails to have a gap. In fact, the same result is holds for any $n$-tuple $ϕ_1,..., ϕ_n$ in any any compact group $K$ that is an almost direct product of SU(2) factors with $L^2(S^2)$ replaced by $L^2(X)$ where $X$ is any homogeneous $K$ space. A weaker result is proven for $n=2$ and some conditional results for similar actions of $F_n$ on homogeneous spaces for more general compact groups.

Explore related subjects

Keep this discovery

BibTeXRIS

David Fisher. 2006-08-14. $\Out(F_n)$ and the spectral gap conjecture. https://arxiv.org/abs/math/0601050

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