Difference between revisions of "Inversion (in combinatorics)"
From Encyclopedia of Mathematics
(Richard Pinch moved page Inversion (in combinatorics) to Derangement: Better translation, see talk page) |
(Replace redirect by disambiguation) |
||
| Line 1: | Line 1: | ||
| − | + | '''Inversion''' may refer to: | |
| + | |||
| + | * An inversion of a permutation $\pi$ on the ordered set $\{1,2,\ldots,n\}$ is a pair $i < j$ such that $\pi(i) > \pi(j)$ | ||
| + | * A [[transposition]], a permutation that exchanges two elements | ||
| + | * A [[derangement]], a permutation with no fixed points | ||
| + | |||
| + | {{TEX|done}} | ||
Latest revision as of 07:22, 2 December 2016
Inversion may refer to:
- An inversion of a permutation $\pi$ on the ordered set $\{1,2,\ldots,n\}$ is a pair $i < j$ such that $\pi(i) > \pi(j)$
- A transposition, a permutation that exchanges two elements
- A derangement, a permutation with no fixed points
How to Cite This Entry:
Inversion (in combinatorics). Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Inversion_(in_combinatorics)&oldid=39878
Inversion (in combinatorics). Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Inversion_(in_combinatorics)&oldid=39878