description of the subgroup series data structure
This document describes the subgroup series data structure, and the operations that can be applied to them.
For information about the (unrelated) power series data structure, see series.
A series of subgroups of a group G is a nested sequence of subgroups of G of either of the forms
The former is called a descending series while the latter is called an ascending series. The subgroups
are called terms of the series, and the integer m is called its length.
Several commands in the GroupTheory package return series data structures representing subgroup series. You can query the data structure for information about it by using any of the methods described below. Particular series may support additional operations not described here. (See the corresponding help for the particular type of series.)
The number of terms in a series S is returned by the numelems command with the series as argument.
If k is a valid index into a series, then the k-th term of the series S is gotten by the expression S[k].
The lowerbound( S ) command returns the least valid index into a series data structure S, and the upperbound( S ) command returns the largest valid index into S.
You can iterate over a series S by using either the seq command, or in a loop as shown below in the examples.
G ≔ DihedralGroup⁡32
L ≔ LowerCentralSeries⁡G
Download Help Document