simplify the presentation for a group
Simplify( G )
Simplify( G, tryhard )
a finitely presented group
The Simplify( G ) command attempts to simplify the presentation associated to the finitely presented group G. First, simplifications try to reduce the numbers of generators and relators, but this may cause an increase in the total relator length.
Use the tryhard option to force the Simplify command to employ more expensive simplifications that aim to reduce the total relator length.
You can use the PresentationComplexity command to measure the result of simplification.
The Simplify( G ) command employs several Tietze transformations, composed in a series of "rounds", to try to produce a "smaller" presentation for the input group G. In the current implementation, each round consists of the following steps:
all relators are cyclically reduced
redundant relator removal
any relators that are trivially redundant are removed
elimination of trivial generators
any trivial generators detected are removed
elimination by "short" relators
relators of length 2 are used to eliminate generators
multiple power relators for the same generator are resolved to a single relator
elimination by "long" relators
relators of length greater than 2 are used to eliminate generators
common subword reduction (tryhard)
with the tryhard option, or for very small presentations, an attempt is made to reduce the total relator length
The first several simplifications listed are relatively inexpensive, and do not increase the total relator length, but may reduce the number of generators and relators.
Elimination by "long" relators is moderately expensive, and decreases the number of generators and relators, at the expense of an increase in the total relator length.
Common subword reduction is very expensive, and is only performed for presentations with few relators, or at the request of the user by the inclusion of the tryhard option.
Because the implementation of this command involves heuristics that employ a trade-off between the level of simplification that can be achieved as well as time- and space-performance, the implementation is expected to evolve. As a result, it cannot be expected that the exact simplifications performed on any given finite presentation will be compatible between Maple releases.
G ≔ a,b,c,d|a2,b2,c2,d2,`.`⁡a,b=c,`.`⁡b,c=d,`.`⁡d,a=b
G ≔ a,b,c|a2,b3,c5,`.`⁡a,b,c=1
G ≔ Simplify⁡G
Note that while the number of generators and relators have each been reduced by one, the total relator length has increased by two.
G ≔ SmallGroup⁡32,5,'form'=fpgroup
As in the previous example, the total relator length is increased, though the number of generators and relators have both been reduced.
Using the tryhard option, more expensive simplifications are attempted which, in this case, successfully reduce the total relator length.
G ≔ Simplify⁡G,'tryhard'
The next example does not result in the elimination of any generators, but the number and total length of the relators is reduced.
G ≔ a,b|`.`⁡a10,b,a,b=1,`.`⁡a11,b,a2,b,a−11,b=1:
H ≔ Simplify⁡G
The Simplify command is typically used on the output of a Reidemeister-Schreier process for producing a presentation of a subgroup of a finitely presented group.
G ≔ a,b,c|a3,b7,c13,`.`⁡a,b2,`.`⁡b,c2,`.`⁡c,a2,`.`⁡a,b,c2=1:
H ≔ Subgroup⁡`.`⁡a,b,c,G:
H ≔ Simplify⁡H:
H ≔ Simplify⁡H,'tryhard':
The GroupTheory[Simplify] 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)