Permutation
A bijection rearranging a set's elements into a new order.
A permutation is a bijection of a set onto itself, representing a rearrangement of its elements. In mathematics, permutations are fundamental in combinatorics and group theory, with applications spanning computer science, quantum physics, and biology.
- field
- Mathematics
- known_for
- Study of permutations as bijections and ordered arrangements; foundation of symmetric groups and Galois theory
- related_concepts
- Factorial, symmetric group, composition of functions, cycle type
Did You Know?
- The number of permutations of n distinct objects is n factorial (n!).
- The collection of all permutations of a set forms a group called the symmetric group.
Frequently Asked Questions
What is a Permutation?
A Permutation is a one-to-one mapping that takes every element of a set and reorders them back into the same set. Think of it as shuffling a deck of cards so each card still appears exactly once, just in a different position.
What role does Permutation play in group theory?
Permutations form the backbone of symmetric groups, where every possible rearrangement of a finite set is treated as a group element. They give mathematicians the language for describing symmetry, composition, and cycle structure across the field.
How is Permutation connected to Factorial?
The total number of distinct Permutations of a set with n elements is exactly n!, the factorial of n. This link is the combinatorial reason factorials pop up so often in counting problems.
Why is Permutation considered foundational in combinatorics?
Nearly every ordered-arrangement question in combinatorics reduces to understanding how elements can be bijectively rearranged. It also underpins Galois theory, where the solvability of polynomial equations hinges on the structure of permutation groups.
Where does Permutation show up outside pure math?
Permutations appear in computer science (sorting, hashing), quantum physics (particle exchange symmetries), and biology (gene ordering and recombination). Their study of how ordered arrangements transform is a universal tool across all these fields.
More in Combinatorics 1-24
Elsewhere in the Combinatorics universe
Spotted an error? Know more?
This is a living reference — every entry is fact-audited, and reader corrections feed straight into our audit queue. Suggest an edit · See this site's audit record