In mathematics, a permutation group is a group G whose elements are permutations of a given set M, and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself); the relationship is often written as (G,M). Note that the group of all permutations of a set is the symmetric group; the term permutation group is usually restricted to mean a subgroup of the symmetric group. The symmetric group of n elements is denoted by Sn; if M is any finite or infinite set, then the group of all permutations of M is often written as Sym(M).
The application of a permutation group to the elements being permuted is called its group action; it has applications in both the study of symmetries, combinatorics and many other branches of mathematics, physics and chemistry.
Read more about Permutation Group: Closure Properties, Examples, Isomorphisms, Transpositions, Simple Transpositions, Inversions and Sorting
Famous quotes containing the word group:
“The government of the United States at present is a foster-child of the special interests. It is not allowed to have a voice of its own. It is told at every move, “Don’t do that, You will interfere with our prosperity.” And when we ask: “where is our prosperity lodged?” a certain group of gentlemen say, “With us.””
—Woodrow Wilson (1856–1924)