A computational approach to the Thompson group $F$
Abstract
Let denote the Thompson group with standard generators , . It is a long standing open problem whether is an amenable group. By a result of Kesten from 1959, amenability of is equivalent to and to where in both cases the norm of an element in the group ring is computed in via the regular representation of . By extensive numerical computations, we obtain precise lower bounds for the norms in and , as well as good estimates of the spectral distributions of and of with respect to the tracial state on the group von Neumann Algebra . Our computational results suggest, that It is however hard to obtain precise upper bounds for the norms, and our methods cannot be used to prove non-amenability of .
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)