return a measure of the complexity of a presentation of a finitely presented group
PresentationComplexity( 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.
G ≔ a,b|a2,b3,`.`⁡a,b5=1
The GroupTheory[PresentationComplexity] command was introduced in Maple 18.
For more information on Maple 18 changes, see Updates in Maple 18.
Download Help Document
What kind of issue would you like to report? (Optional)