schreierGraph G
For a finite group action, we form a HashTable whose keys are the generators provided by the user. The value corresponding to a generator g is a HashTable containing all pairs a => b such that a*g == b. This represents the Schreier graph of the group relative to the generating set provided by the user.
The following example defines the permutation action of a symmetric group on three elements using only two generators, a transposition and a 3-cycle.
|
|
|
|
The object schreierGraph is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/InvariantRing/FiniteGroupsDoc.m2:261:0.