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 is an amenable group. In this paper we show that if , , denote the standard generators of Thompson group and then Moreover, the upper bound is attained if the Thompson group is amenable. Here, the norm of an element in the group ring is computed in via the regular representation of . Using the "cyclic reduced" numbers , , 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 where is the tracial state on the group von Neumann algebra . Our extensive numerical computations suggest that and thus that might be non-amenable. However, we can in no way rule out that .
Keywords
Cite
@article{arxiv.1705.00198,
title = {Computational explorations of the Thompson group T for the amenability problem of F},
author = {S. Haagerup and U. Haagerup and M. Ramirez-Solano},
journal= {arXiv preprint arXiv:1705.00198},
year = {2018}
}
Comments
Accepted for publication in the journal Experimental Mathematics. Updated with the referee suggestions