2015
DOI: 10.1142/s0218196715500022
|View full text |Cite
|
Sign up to set email alerts
|

A computational approach to the Thompson group F

Abstract: Communicated by M. SapirLet F denote the Thompson group with standard generators A = x 0 , B = x 1 . It is a long standing open problem whether F is an amenable group. By a result of Kesten from 1959, amenability of F is equivalent towhere in both cases the norm of an element in the group ring CF is computed in B( 2 (F )) via the regular representation of F . By extensive numerical computations, we obtain precise lower bounds for the norms in (i) and (ii), as well as good estimates of the spectral distribution… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
26
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(26 citation statements)
references
References 24 publications
0
26
0
Order By: Relevance
“…It is a long standing open problem whether the Thompson group F is amenable. The present paper is a continuation of the work started in [10] by the same authors.…”
Section: Introductionmentioning
confidence: 55%
See 4 more Smart Citations
“…It is a long standing open problem whether the Thompson group F is amenable. The present paper is a continuation of the work started in [10] by the same authors.…”
Section: Introductionmentioning
confidence: 55%
“…where S := D 2 and C, and D are the generators of T shown in Figure 1. Let τ be the trace on CT coming from the group von Neumann algebra L(T ), as described in [10,Section 2]. Using the trace properties of τ , the even moments for the self-adjoint operator…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations