...
首页> 外文期刊>Journal of combinatorial algebra >Complexity among the finitely generated subgroups of Thompson's group
【24h】

Complexity among the finitely generated subgroups of Thompson's group

机译:复杂性有限生成的子组汤普森的组

获取原文
           

摘要

We demonstrate the existence of a family of finitely generated subgroups of Richard Thompson's group F which is strictly well-ordered by the embeddability relation of type epsilon(0)+Sigma 1. All except the maximum element of this family (which is F itself) are elementary amenable groups. In fact we also obtain, for each alpha < epsilon(0), a finitely generated elementary amenable subgroup of F whose EA-class is alpha + 2. These groups all have simple, explicit descriptions and can be viewed as a natural continuation of the progression which starts with Z + Z, Z (sic) Z, and the Brin-Navas group B. We also give an example of a pair of finitely generated elementary amenable subgroups of F with the property that neither is embeddable into the other.
机译:我们将演示一个家庭的存在理查德的有限生成子组汤普森的F组严格秩序井然的关系嵌入性的类型ε(0)+σ1。这个家庭的元素(F)基本的组。获得,对于每个α<ε(0),一个有限生成基本的子群的FEA-class是α+ 2。简单、明确的描述,可以查看作为一个自然的延续发展开始与Z + Z Z Z(原文如此),和Brin-Navas集团给出的一个例子一双有限生成基本的子也不是F的属性可嵌入到另一个。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号