Refined solvable presentations for polycyclic groups
Refined solvable presentations for polycyclic groups
复制标题
多环群的精致可解表示
DOI：
10.22108/ijgt.2012.452
复制
发表时间：
2011
影响因子：
0.2
通讯作者：
G. Traustason
中科院分区：
文献类型：
--
作者：
René Hartung;G. Traustason
我们描述了一种新的表示，当，，描述多循环群时。本文是通过精化一系列具有交换截面的正规子群得到的。这些演示文稿可以在计算机代数系统中有效地描述，如$GAP$或$MAGMA$。我们研究了这些演示文稿和，，特别是，，我们得到了它们的一致性标准。一致性实现表明，在某些情况下，新方法比多循环群的现有方法更快。
We describe a new type of presentation that, when consistent, describes a polycyclic group. This presentation is obtained by refining a series of normal subgroups with abelian sections. These presentations can be described effectively in computer-algebra-systems like $ Gap$ or $ Magma$. We study these presentations and, in particular, we obtain consistency criteria for them. The consistency implementation demonstrates that there are situations where the new method is faster than the existing methods for polycyclic groups.