On the isomorphism problem for finitely generated Coxeter groups. I, Basic matching
On the isomorphism problem for finitely generated Coxeter groups. I, Basic matching
复制标题
关于有限生成 Coxeter 群的同构问题。
DOI:
--
复制
发表时间:
2005
期刊:
影响因子:
--
通讯作者:
S. Tschantz
中科院分区:
文献类型:
--
作者:
M. Mihalik;J. Ratcliffe;S. Tschantz
This paper is concerned with finding necessary conditions for two Coxeter groups to be isomorphic in terms of their visual subgroups. In part I of the paper, we prove a matching theorem for maximal rank irreducible noncyclic spherical subgroups of isomorphic Coxeter groups.