课题基金 / 基金详情

Complexity amongst the finitely generated subgroups of Thompson's Group

Complexity amongst the finitely generated subgroups of Thompson's Group
汤普森群的有限生成子群之间的复杂性
批准号:
2275823
负责人:
金额:
$0.0万
依托单位:
依托单位国家:
英国
项目类别:
Studentship
财政年份:
2019
资助国家:
英国
项目状态:
已结题
起止时间:
2019 至 --

项目摘要

项目成果

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
This project is aimed at exploring the structure of groups (and of subgroups of groups) in the generalised R. Thompson family of groups, under various complexity constraints. The generalised R. Thompson family of groups represents an important class of groups, where the theory of these groups often has connections and applications to/in various areas of mathematics including topology, analysis, logic, and dynamics.The complexity constraints we have in mind are of various types: E.g., exploring the structure of the elementary amenable subgroups of R. Thompson group F, exploring groups or subgroups under growth conditions for counting group elements, considering the subgroup structure of those subgroups of R. Thompson's groups T or V which contain no non-abelian free subgroups, understanding commutator width in any of the R. Thompson groups or their generalisations, deciding if the boundary groups for Thurston's Piecewise Integral Projective groups (natural generalisations of R. Thompson's group T) are finitely generated or not, and etc.SMSTC courses; ID5101; school seminars
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
海外基金