SearcharxivSearch

arXiv · 1705.00198

Computational explorations of the Thompson group T for the amenability problem of F

Abstract

It is a long standing open problem whether the Thompson group $F$ is an amenable group. In this paper we show that if $A$, $B$, $C$ denote the standard generators of Thompson group $T$ and $D:=C B A^{-1}$ then $$\sqrt2+\sqrt3\,<\,\frac1{\sqrt{12}}||(I+C+C^2)(I+D+D^2+D^3)||\,\le\, 2+\sqrt2.$$ Moreover, the upper bound is attained if the Thompson group $F$ is amenable. Here, the norm of an element in the group ring $\mathbb{C} T$ is computed in $B(\ell^2(T))$ via the regular representation of $T$. Using the "cyclic reduced" numbers $\tau(((C+C^2)(D+D^2+D^3))^n)$, $n\in\mathbb{N}$, and some methods from our previous paper [arXiv:1409.1486] we can obtain precise lower bounds as well as good estimates of the spectral distributions of $\frac1{12}((I+C+C^2)(I+D+D^2+D^3))^*(I+C+C^2)(I+D+D^2+D^3),$ where $\tau$ is the tracial state on the group von Neumann algebra $L(T)$. Our extensive numerical computations suggest that $$\frac1{\sqrt{12}}||(I+C+C^2)(I+D+D^2+D^3)||\approx 3.28,$$ and thus that $F$ might be non-amenable. However, we can in no way rule out that $\frac1{\sqrt{12}}||(I+C+C^2)(I+D+D^2+D^3)||=\, 2+\sqrt2$.

Explore related subjects

Keep this discovery

BibTeXRIS

S. Haagerup, U. Haagerup, M. Ramirez-Solano. 2017-04-29. Computational explorations of the Thompson group T for the amenability problem of F. https://arxiv.org/abs/1705.00198

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