|
Calling Sequence
|
|
AllSmallGroups( r )
AllSmallGroups( r, opts )
|
|
Parameters
|
|
r
|
-
|
a positive integer, an integer range, or a small group ID range
|
opts
|
-
|
(optional) equations of the form keyword = value, as explained below
|
|
|
|
|
Options
|
|
•
|
The form option can be set either to "permgroup" (the default) or to "fpgroup", which controls the type of groups returned by the AllSmallGroups command. If 'form' = "permgroup" is used, then the groups returned are permutation groups, while finitely presented groups are returned if 'form' = "fpgroup" is passed,
|
•
|
The output option can be set either to "list" (the default) or to "iterator". If 'form' = "list" is passed, then a list of the groups specified by the parameter r is returned. If 'form' = "iterator" is passed, then an iterator object is returned which you can use to iterate over the selected groups one at a time. This is useful if the number of groups selected is large, since each group is constructed only as needed instead of creating a large list of all the groups at once.
|
|
|
Description
|
|
•
|
The small groups library contains all groups of small orders up to . The groups are sorted by their orders and they are listed up to isomorphism; that is, for each of the available orders a complete and irredundant list of isomorphism type representatives of groups is given. These groups are available as permutation groups and as groups defined by generators and relations.
|
•
|
In its simplest form, the command AllSmallGroups( r ) returns a list of all the small groups in the small groups library of order r, where r is a positive integer less than .
|
•
|
If r is a range of the form m .. n, where m and n are positive integers, then AllSmallGroups( r ) returns a list of all the groups whose order lies in the range m .. n.
|
•
|
More generally, r may be a "range" of the form [ln, lk] .. [un, uk], where ln and un are positive integer less than , and where lk is a positive integer in the range 1 .. NumGroups( ln ), and uk is an integer in the range 1 .. NumGroups( un ). In this case, AllSmallGroups( r ) returns a list of the groups whose orders lie in the range ln .. un, beginning with the lk-th group of order ln, and ending with the uk-th group of order un. Think of the groups of each order as forming a "row" of a "ragged" matrix, and the first operand of the range r specifies a first position in this matrix, while the second operand of r specifies a second position in the matrix, so that the range r selects all the groups occurring between these two positions, where the matrix is traversed in row-major order, from the first to the second position.
|
|
|
Examples
|
|
>
|
|
Return a list of all groups of order , as permutation groups.
| (1) |
Return a list of all groups of order , this time, as finitely presented groups.
>
|
|
| (2) |
This is the same as the default.
>
|
|
| (3) |
Use a range to get all the groups whose order lies in the range.
| (4) |
The range endpoints can be small group IDs enclosed in a list. This example returns all groups with IDs lexicographically between groups with SmallGroup ID and , inclusive.
>
|
|
| (5) |
Again, but this time the resulting groups are finitely presented groups.
>
|
|
| (6) |
One way (not the best) to find the Small Group IDs of those groups of order with nilpotency class uses an iterator output, as follows.
>
|
|
| (7) |
>
|
|
(A much better way to do this is to use the SearchSmallGroups command.)
>
|
|
| (9) |
Iterator outputs are particularly useful when you want to find just one (usually the first) example of a group with some property. This example looks for the first non-supersoluble group of order .
>
|
|
| (10) |
>
|
|
Rather than constructing all groups of order , only groups needed to be constructed to find the desired example. (Again, however, SearchSmallGroups would find all such examples nearly instantly.)
|
|
Compatibility
|
|
•
|
The GroupTheory[AllSmallGroups] command was introduced in Maple 17.
|
•
|
The GroupTheory[AllSmallGroups] command was updated in Maple 2022.
|
•
|
The output option was introduced in Maple 2022.
|
|
|
|