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 2+3\,<\,112||(I+C+C2)(I+D+D2+D3)||\,\, 2+2. Moreover, the upper bound is attained if the Thompson group F is amenable. Here, the norm of an element in the group ring C T is computed in B(2(T)) via the regular representation of T. Using the "cyclic reduced" numbers τ(((C+C2)(D+D2+D3))n), n∈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 112((I+C+C2)(I+D+D2+D3))*(I+C+C2)(I+D+D2+D3), where τ is the tracial state on the group von Neumann algebra L(T). Our extensive numerical computations suggest that 112||(I+C+C2)(I+D+D2+D3)||≈ 3.28, and thus that F might be non-amenable. However, we can in no way rule out that 112||(I+C+C2)(I+D+D2+D3)||=\, 2+2.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…