Computing the order of a solvable permutation group (Q913945): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: On the length of subgroup chains in the symmetric group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3792860 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The solvable length of a solvable linear group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A compact representation for permutation groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0747-7171(08)80083-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2045451947 / rank | |||
Normal rank |
Latest revision as of 11:55, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing the order of a solvable permutation group |
scientific article |
Statements
Computing the order of a solvable permutation group (English)
0 references
1990
0 references
If a group G of permutations is given by a set of generators usually the first step for its investigation is the determination of a base and a strong generating system by one of the versions of the Schreier-Sims method [cf. \textit{J. S. Leon}; Math. Comput. 35, 941-974 (1980; Zbl 0444.20001)]. In this article the author describes a new method, which works if G is soluble (it runs into an endless cycle if G is not soluble). The method is not only considerably faster in many cases tested, but it also constructs at the same time a ``polycyclic generating sequence'', i.e. a sequence of generators \(y_ 1,...,y_ t\) of G such that with \(H_ i=<y_ i,...,y_ t>\) one has \(H_ i\triangleleft H_{i-1}\) for \(1<i\leq t\) and \(H_ 1=G\). There are a number of computational problems, e.g. the determination of the conjugacy classes, for which rather efficient solutions are known for soluble groups using such a polycyclic generating sequence, while they are notoriously difficult using only base and strong generating set. Like other computational methods for soluble groups this one exploits the fact that an orbit of a normal subgroup of a group G is a block for G.
0 references
permutations
0 references
generators
0 references
strong generating system
0 references
Schreier-Sims method
0 references
conjugacy classes
0 references
soluble groups
0 references
polycyclic generating sequence
0 references