English

A computational approach to the Thompson group $F$

Group Theory 2015-02-09 v3 Operator Algebras

Abstract

Let FF denote the Thompson group with standard generators A=x0A=x_0, B=x1B=x_1. It is a long standing open problem whether FF is an amenable group. By a result of Kesten from 1959, amenability of FF is equivalent to (i)I+A+B=3(i)\qquad ||I+A+B||=3 and to (ii)A+A1+B+B1=4,(ii)\qquad ||A+A^{-1}+B+B^{-1}||=4, where in both cases the norm of an element in the group ring CF\mathbb{C} F is computed in B(2(F))B(\ell^2(F)) via the regular representation of FF. By extensive numerical computations, we obtain precise lower bounds for the norms in (i)(i) and (ii)(ii), as well as good estimates of the spectral distributions of (I+A+B)(I+A+B)(I+A+B)^*(I+A+B) and of A+A1+B+B1A+A^{-1}+B+B^{-1} with respect to the tracial state τ\tau on the group von Neumann Algebra L(F)L(F). Our computational results suggest, that I+A+B2.95A+A1+B+B13.87.||I+A+B||\approx 2.95 \qquad ||A+A^{-1}+B+B^{-1}||\approx 3.87. It is however hard to obtain precise upper bounds for the norms, and our methods cannot be used to prove non-amenability of FF.

Keywords

Cite

@article{arxiv.1409.1486,
  title  = {A computational approach to the Thompson group $F$},
  author = {S. Haagerup and U. Haagerup and M. Ramirez-Solano},
  journal= {arXiv preprint arXiv:1409.1486},
  year   = {2015}
}

Comments

appears in International Journal of Algebra and Computation (2015)

R2 v1 2026-06-22T05:48:43.372Z