permutation group

Show Summary Details

Quick Reference

A subgroup of the group that is formed from the set, Sn, of all permutations of n distinct elements and on which is defined the dyadic operation of composition of functions. The full group Sn is usually called the symmetric group and possesses n! elements. Every finite group is isomorphic to some permutation group.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.