Combinatorics Basic counting Concept
Permutation
Summary
A permutation of a set is a rearrangement of its elements, that is, a bijection from the set to itself. Permutations are the basic objects of enumerative combinatorics and of the theory of symmetric groups. The node permutation gives the precise definition.
Where this leads
11 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Permutation, Definition
About this page
| Tag | 05RWFKVTJ7 |
|---|---|
| URI | m2://05RWFKVTJ7 |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05A05 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.