GroupTheory
PresentationComplexity
return a measure of the complexity of a presentation of a finitely presented group
Calling Sequence
Parameters
Description
Examples
Compatibility
PresentationComplexity( G )
G
-
a finitely presented group
The PresentationComplexity( G ) command returns a triple of the form (m, n, k), where m is the number of generators currently defined for G, n is the number of relators currently defined for G, and k is the total length of the relators.
The GroupTheory[PresentationComplexity] command was introduced in Maple 18.
For more information on Maple 18 changes, see Updates in Maple 18.
See Also
GroupTheory[Generators]
Download Help Document