Infinite combinatorics, definability, and maximal cofinitary groups

发布时间:2023-04-03浏览次数:645

题目:Infinite combinatorics, definability, and maximal cofinitary groups


报告人:David Schrittesser(哈尔滨工业大学


时间:44星期),16:00-17:00


地点:明德楼201报告厅

Zoom会议会议号:832 6498 6834,会议密码:2023


摘要:The notion of a cofinitary groups was named by Peter Cameron in the 1980ies, as a dual to the notion of finitary permutation groups. Cameron asked about such groups which are maximal in the sense that they are not proper subgroups of another cofinitary group.

Presumably due to a superficial similarity with so-called MAD families, it was long thought that such maximal cofinitary groups are necessarily extremely complicated objects, akin to monsters like the paradoxical decomposition of the sphere. It turns out that on the contrary, they can be constructed in a very, very concrete manner.

In this talk, I will sketch some ideas leading to this construction and give a some context to explain why it surprised everyone. There are also some possible connections to the world of operator algebras which I will discuss if time permits.


更多相关信息请参见Colloquium Talks

Copyright (C)2023 哈尔滨工业大学数学研究院版权所有
人才招聘:
联系我们:
电话:86413107      邮箱:IASM@hit.edu.cn
地址:哈尔滨市南岗区西大直街92号
技术支持:哈尔滨工业大学网络安全和信息化办公室