On Normalish Subgroups of the R. Thompson Groups

被引:1
|
作者
Bleak, Collin [1 ]
机构
[1] Univ St Andrews, St Andrews KY16 9SS, Fife, Scotland
来源
基金
英国工程与自然科学研究理事会;
关键词
Thompson's group; Amenable; C*-simplicity; Regular language; Synchronizing automata; Group actions; Normalish subgroups; Wreath product; SOLVABLE-GROUPS; CLASSIFICATION;
D O I
10.1007/978-3-030-48516-0_3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Results in C* algebras, of Matte Bon and Le Boudec, and of Haagerup and Olesen, apply to the R. Thompson groups F <= T <= V. These results together show that F is non-amenable if and only if T has a simple reduced C*-algebra. In further investigations into the structure of C*-algebras, Breuillard, Kalantar, Kennedy, and Ozawa introduce the notion of a normalish subgroup of a group G. They show that if a group G admits no non-trivial finite normal subgroups and no normalish amenable subgroups then it has a simple reduced C*-algebra. Our chief result concerns the R. Thompson groups F < T < V; we show that there is an elementary amenable group E < F (where here, E congruent to...) (sic) Z) (sic) Z) (sic) Z) with E normalish in V. The proof given uses a natural partial action of the group V on a regular language determined by a synchronizing automaton in order to verify a certain stability condition: once again highlighting the existence of interesting intersections of the theory of V with various forms of formal language theory.
引用
收藏
页码:29 / 42
页数:14
相关论文
共 50 条