group[pres] - find a presentation for a subgroup of a group
|
Calling Sequence
|
|
pres( sg )
|
|
Parameters
|
|
sbgrl
|
-
|
subgroup of a group given by generators and relations (i.e. a subgrel
|
|
|
|
|
Description
|
|
•
|
This procedure attempts to find a set of relations among the given subgroup's generators sufficient to define the subgroup. The result is returned as a grelgroup.
|
•
|
The algorithm uses Todd-Coxeter coset enumeration, which is an inherently non-terminating process for infinite groups. Therefore, the algorithm will halt with an exception if too many cosets are generated during an attempt to enumerate cosets of a subgroup. The point at which the coset enumeration terminates is controlled by the environment variable _EnvMaxCosetsToddCoxeter, which has the default value .
|
|
|
Download Help Document
Was this information helpful?