2010
DOI: 10.1016/j.jfa.2009.06.029
|View full text |Cite
|
Sign up to set email alerts
|

The Dixmier problem, lamplighters and Burnside groups

Abstract: J. Dixmier asked in 1950 whether every non-amenable group admits uniformly bounded representations that cannot be unitarised. We provide such representations upon passing to extensions by abelian groups. This gives a new characterisation of amenability. Furthermore, we deduce that certain Burnside groups are non-unitarisable, answering a question raised by G. Pisier.Comment: 4 page

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
32
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
9
1

Relationship

2
8

Authors

Journals

citations
Cited by 29 publications
(32 citation statements)
references
References 9 publications
0
32
0
Order By: Relevance
“…Combining Theorems 1 and 2 with the main result of ref. 36, we conclude that the wreath product Z ≀ H is a torsion-free nonunitarisable group without free subgroups. We can replace it by a finitely generated subgroup upon choosing a nonamenable, finitely generated subgroup of H. This construction provides some new examples to Dixmier's problem, unsolved since 1950 (37)(38)(39).…”
mentioning
confidence: 66%
“…Combining Theorems 1 and 2 with the main result of ref. 36, we conclude that the wreath product Z ≀ H is a torsion-free nonunitarisable group without free subgroups. We can replace it by a finitely generated subgroup upon choosing a nonamenable, finitely generated subgroup of H. This construction provides some new examples to Dixmier's problem, unsolved since 1950 (37)(38)(39).…”
mentioning
confidence: 66%
“…Therefore, in view of Theorem 1.1, Dixmier's problem is equivalent to the conjunction of Question 8.7 with the following. There is however a form of overlap between these two questions, as can be shown using the main result of [24], as follows.…”
Section: B Burnside Groupsmentioning
confidence: 99%
“…The Dixmier problem asks whether the converse holds true (see, for instance, [14]). In [13], Monod The restricted second nilpotent wreath product…”
Section: Introductionmentioning
confidence: 99%