Soluble permutation groups
This chapter has introduced the data structures of B-strong series-generating sequence and cyclically extended Schreier vectors as a representation of a soluble permutation group. Algorithms to construct the data structure, compute normal words, and compute with the isomorphism between the permutation group and the group defined by the pc presentation have been presented.
Unable to display preview. Download preview PDF.