Identifier
-
Mp00058:
Perfect matchings
—to permutation⟶
Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000463: Permutations ⟶ ℤ
Values
[(1,2)] => [2,1] => [1,2] => 0
[(1,2),(3,4)] => [2,1,4,3] => [1,2,3,4] => 0
[(1,3),(2,4)] => [3,4,1,2] => [1,3,2,4] => 1
[(1,4),(2,3)] => [4,3,2,1] => [1,4,2,3] => 2
[(1,2),(3,4),(5,6)] => [2,1,4,3,6,5] => [1,2,3,4,5,6] => 0
[(1,3),(2,4),(5,6)] => [3,4,1,2,6,5] => [1,3,2,4,5,6] => 1
[(1,4),(2,3),(5,6)] => [4,3,2,1,6,5] => [1,4,2,3,5,6] => 2
[(1,5),(2,3),(4,6)] => [5,3,2,6,1,4] => [1,5,2,3,4,6] => 3
[(1,6),(2,3),(4,5)] => [6,3,2,5,4,1] => [1,6,2,3,4,5] => 4
[(1,6),(2,4),(3,5)] => [6,4,5,2,3,1] => [1,6,2,4,3,5] => 5
[(1,5),(2,4),(3,6)] => [5,4,6,2,1,3] => [1,5,2,4,3,6] => 4
[(1,4),(2,5),(3,6)] => [4,5,6,1,2,3] => [1,4,2,5,3,6] => 3
[(1,3),(2,5),(4,6)] => [3,5,1,6,2,4] => [1,3,2,5,4,6] => 2
[(1,2),(3,5),(4,6)] => [2,1,5,6,3,4] => [1,2,3,5,4,6] => 1
[(1,2),(3,6),(4,5)] => [2,1,6,5,4,3] => [1,2,3,6,4,5] => 2
[(1,3),(2,6),(4,5)] => [3,6,1,5,4,2] => [1,3,2,6,4,5] => 3
[(1,4),(2,6),(3,5)] => [4,6,5,1,3,2] => [1,4,2,6,3,5] => 4
[(1,5),(2,6),(3,4)] => [5,6,4,3,1,2] => [1,5,2,6,3,4] => 5
[(1,6),(2,5),(3,4)] => [6,5,4,3,2,1] => [1,6,2,5,3,4] => 6
[(1,2),(3,4),(5,6),(7,8)] => [2,1,4,3,6,5,8,7] => [1,2,3,4,5,6,7,8] => 0
[(1,3),(2,4),(5,6),(7,8)] => [3,4,1,2,6,5,8,7] => [1,3,2,4,5,6,7,8] => 1
[(1,4),(2,3),(5,6),(7,8)] => [4,3,2,1,6,5,8,7] => [1,4,2,3,5,6,7,8] => 2
[(1,5),(2,3),(4,6),(7,8)] => [5,3,2,6,1,4,8,7] => [1,5,2,3,4,6,7,8] => 3
[(1,6),(2,3),(4,5),(7,8)] => [6,3,2,5,4,1,8,7] => [1,6,2,3,4,5,7,8] => 4
[(1,7),(2,3),(4,5),(6,8)] => [7,3,2,5,4,8,1,6] => [1,7,2,3,4,5,6,8] => 5
[(1,8),(2,3),(4,5),(6,7)] => [8,3,2,5,4,7,6,1] => [1,8,2,3,4,5,6,7] => 6
[(1,8),(2,4),(3,5),(6,7)] => [8,4,5,2,3,7,6,1] => [1,8,2,4,3,5,6,7] => 7
[(1,7),(2,4),(3,5),(6,8)] => [7,4,5,2,3,8,1,6] => [1,7,2,4,3,5,6,8] => 6
[(1,6),(2,4),(3,5),(7,8)] => [6,4,5,2,3,1,8,7] => [1,6,2,4,3,5,7,8] => 5
[(1,5),(2,4),(3,6),(7,8)] => [5,4,6,2,1,3,8,7] => [1,5,2,4,3,6,7,8] => 4
[(1,4),(2,5),(3,6),(7,8)] => [4,5,6,1,2,3,8,7] => [1,4,2,5,3,6,7,8] => 3
[(1,3),(2,5),(4,6),(7,8)] => [3,5,1,6,2,4,8,7] => [1,3,2,5,4,6,7,8] => 2
[(1,2),(3,5),(4,6),(7,8)] => [2,1,5,6,3,4,8,7] => [1,2,3,5,4,6,7,8] => 1
[(1,2),(3,6),(4,5),(7,8)] => [2,1,6,5,4,3,8,7] => [1,2,3,6,4,5,7,8] => 2
[(1,3),(2,6),(4,5),(7,8)] => [3,6,1,5,4,2,8,7] => [1,3,2,6,4,5,7,8] => 3
[(1,4),(2,6),(3,5),(7,8)] => [4,6,5,1,3,2,8,7] => [1,4,2,6,3,5,7,8] => 4
[(1,5),(2,6),(3,4),(7,8)] => [5,6,4,3,1,2,8,7] => [1,5,2,6,3,4,7,8] => 5
[(1,6),(2,5),(3,4),(7,8)] => [6,5,4,3,2,1,8,7] => [1,6,2,5,3,4,7,8] => 6
[(1,7),(2,5),(3,4),(6,8)] => [7,5,4,3,2,8,1,6] => [1,7,2,5,3,4,6,8] => 7
[(1,8),(2,5),(3,4),(6,7)] => [8,5,4,3,2,7,6,1] => [1,8,2,5,3,4,6,7] => 8
[(1,8),(2,6),(3,4),(5,7)] => [8,6,4,3,7,2,5,1] => [1,8,2,6,3,4,5,7] => 9
[(1,7),(2,6),(3,4),(5,8)] => [7,6,4,3,8,2,1,5] => [1,7,2,6,3,4,5,8] => 8
[(1,6),(2,7),(3,4),(5,8)] => [6,7,4,3,8,1,2,5] => [1,6,2,7,3,4,5,8] => 7
[(1,5),(2,7),(3,4),(6,8)] => [5,7,4,3,1,8,2,6] => [1,5,2,7,3,4,6,8] => 6
[(1,4),(2,7),(3,5),(6,8)] => [4,7,5,1,3,8,2,6] => [1,4,2,7,3,5,6,8] => 5
[(1,3),(2,7),(4,5),(6,8)] => [3,7,1,5,4,8,2,6] => [1,3,2,7,4,5,6,8] => 4
[(1,2),(3,7),(4,5),(6,8)] => [2,1,7,5,4,8,3,6] => [1,2,3,7,4,5,6,8] => 3
[(1,2),(3,8),(4,5),(6,7)] => [2,1,8,5,4,7,6,3] => [1,2,3,8,4,5,6,7] => 4
[(1,3),(2,8),(4,5),(6,7)] => [3,8,1,5,4,7,6,2] => [1,3,2,8,4,5,6,7] => 5
[(1,4),(2,8),(3,5),(6,7)] => [4,8,5,1,3,7,6,2] => [1,4,2,8,3,5,6,7] => 6
[(1,5),(2,8),(3,4),(6,7)] => [5,8,4,3,1,7,6,2] => [1,5,2,8,3,4,6,7] => 7
[(1,6),(2,8),(3,4),(5,7)] => [6,8,4,3,7,1,5,2] => [1,6,2,8,3,4,5,7] => 8
[(1,7),(2,8),(3,4),(5,6)] => [7,8,4,3,6,5,1,2] => [1,7,2,8,3,4,5,6] => 9
[(1,8),(2,7),(3,4),(5,6)] => [8,7,4,3,6,5,2,1] => [1,8,2,7,3,4,5,6] => 10
[(1,8),(2,7),(3,5),(4,6)] => [8,7,5,6,3,4,2,1] => [1,8,2,7,3,5,4,6] => 11
[(1,7),(2,8),(3,5),(4,6)] => [7,8,5,6,3,4,1,2] => [1,7,2,8,3,5,4,6] => 10
[(1,6),(2,8),(3,5),(4,7)] => [6,8,5,7,3,1,4,2] => [1,6,2,8,3,5,4,7] => 9
[(1,5),(2,8),(3,6),(4,7)] => [5,8,6,7,1,3,4,2] => [1,5,2,8,3,6,4,7] => 8
[(1,4),(2,8),(3,6),(5,7)] => [4,8,6,1,7,3,5,2] => [1,4,2,8,3,6,5,7] => 7
[(1,3),(2,8),(4,6),(5,7)] => [3,8,1,6,7,4,5,2] => [1,3,2,8,4,6,5,7] => 6
[(1,2),(3,8),(4,6),(5,7)] => [2,1,8,6,7,4,5,3] => [1,2,3,8,4,6,5,7] => 5
[(1,2),(3,7),(4,6),(5,8)] => [2,1,7,6,8,4,3,5] => [1,2,3,7,4,6,5,8] => 4
[(1,3),(2,7),(4,6),(5,8)] => [3,7,1,6,8,4,2,5] => [1,3,2,7,4,6,5,8] => 5
[(1,4),(2,7),(3,6),(5,8)] => [4,7,6,1,8,3,2,5] => [1,4,2,7,3,6,5,8] => 6
[(1,5),(2,7),(3,6),(4,8)] => [5,7,6,8,1,3,2,4] => [1,5,2,7,3,6,4,8] => 7
[(1,6),(2,7),(3,5),(4,8)] => [6,7,5,8,3,1,2,4] => [1,6,2,7,3,5,4,8] => 8
[(1,7),(2,6),(3,5),(4,8)] => [7,6,5,8,3,2,1,4] => [1,7,2,6,3,5,4,8] => 9
[(1,8),(2,6),(3,5),(4,7)] => [8,6,5,7,3,2,4,1] => [1,8,2,6,3,5,4,7] => 10
[(1,8),(2,5),(3,6),(4,7)] => [8,5,6,7,2,3,4,1] => [1,8,2,5,3,6,4,7] => 9
[(1,7),(2,5),(3,6),(4,8)] => [7,5,6,8,2,3,1,4] => [1,7,2,5,3,6,4,8] => 8
[(1,6),(2,5),(3,7),(4,8)] => [6,5,7,8,2,1,3,4] => [1,6,2,5,3,7,4,8] => 7
[(1,5),(2,6),(3,7),(4,8)] => [5,6,7,8,1,2,3,4] => [1,5,2,6,3,7,4,8] => 6
[(1,4),(2,6),(3,7),(5,8)] => [4,6,7,1,8,2,3,5] => [1,4,2,6,3,7,5,8] => 5
[(1,3),(2,6),(4,7),(5,8)] => [3,6,1,7,8,2,4,5] => [1,3,2,6,4,7,5,8] => 4
[(1,2),(3,6),(4,7),(5,8)] => [2,1,6,7,8,3,4,5] => [1,2,3,6,4,7,5,8] => 3
[(1,2),(3,5),(4,7),(6,8)] => [2,1,5,7,3,8,4,6] => [1,2,3,5,4,7,6,8] => 2
[(1,3),(2,5),(4,7),(6,8)] => [3,5,1,7,2,8,4,6] => [1,3,2,5,4,7,6,8] => 3
[(1,4),(2,5),(3,7),(6,8)] => [4,5,7,1,2,8,3,6] => [1,4,2,5,3,7,6,8] => 4
[(1,5),(2,4),(3,7),(6,8)] => [5,4,7,2,1,8,3,6] => [1,5,2,4,3,7,6,8] => 5
[(1,6),(2,4),(3,7),(5,8)] => [6,4,7,2,8,1,3,5] => [1,6,2,4,3,7,5,8] => 6
[(1,7),(2,4),(3,6),(5,8)] => [7,4,6,2,8,3,1,5] => [1,7,2,4,3,6,5,8] => 7
[(1,8),(2,4),(3,6),(5,7)] => [8,4,6,2,7,3,5,1] => [1,8,2,4,3,6,5,7] => 8
[(1,8),(2,3),(4,6),(5,7)] => [8,3,2,6,7,4,5,1] => [1,8,2,3,4,6,5,7] => 7
[(1,7),(2,3),(4,6),(5,8)] => [7,3,2,6,8,4,1,5] => [1,7,2,3,4,6,5,8] => 6
[(1,6),(2,3),(4,7),(5,8)] => [6,3,2,7,8,1,4,5] => [1,6,2,3,4,7,5,8] => 5
[(1,5),(2,3),(4,7),(6,8)] => [5,3,2,7,1,8,4,6] => [1,5,2,3,4,7,6,8] => 4
[(1,4),(2,3),(5,7),(6,8)] => [4,3,2,1,7,8,5,6] => [1,4,2,3,5,7,6,8] => 3
[(1,3),(2,4),(5,7),(6,8)] => [3,4,1,2,7,8,5,6] => [1,3,2,4,5,7,6,8] => 2
[(1,2),(3,4),(5,7),(6,8)] => [2,1,4,3,7,8,5,6] => [1,2,3,4,5,7,6,8] => 1
[(1,2),(3,4),(5,8),(6,7)] => [2,1,4,3,8,7,6,5] => [1,2,3,4,5,8,6,7] => 2
[(1,3),(2,4),(5,8),(6,7)] => [3,4,1,2,8,7,6,5] => [1,3,2,4,5,8,6,7] => 3
[(1,4),(2,3),(5,8),(6,7)] => [4,3,2,1,8,7,6,5] => [1,4,2,3,5,8,6,7] => 4
[(1,5),(2,3),(4,8),(6,7)] => [5,3,2,8,1,7,6,4] => [1,5,2,3,4,8,6,7] => 5
[(1,6),(2,3),(4,8),(5,7)] => [6,3,2,8,7,1,5,4] => [1,6,2,3,4,8,5,7] => 6
[(1,7),(2,3),(4,8),(5,6)] => [7,3,2,8,6,5,1,4] => [1,7,2,3,4,8,5,6] => 7
[(1,8),(2,3),(4,7),(5,6)] => [8,3,2,7,6,5,4,1] => [1,8,2,3,4,7,5,6] => 8
[(1,8),(2,4),(3,7),(5,6)] => [8,4,7,2,6,5,3,1] => [1,8,2,4,3,7,5,6] => 9
[(1,7),(2,4),(3,8),(5,6)] => [7,4,8,2,6,5,1,3] => [1,7,2,4,3,8,5,6] => 8
[(1,6),(2,4),(3,8),(5,7)] => [6,4,8,2,7,1,5,3] => [1,6,2,4,3,8,5,7] => 7
[(1,5),(2,4),(3,8),(6,7)] => [5,4,8,2,1,7,6,3] => [1,5,2,4,3,8,6,7] => 6
[(1,4),(2,5),(3,8),(6,7)] => [4,5,8,1,2,7,6,3] => [1,4,2,5,3,8,6,7] => 5
>>> Load all 126 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The number of admissible inversions of a permutation.
Let $w = w_1,w_2,\dots,w_k$ be a word of length $k$ with distinct letters from $[n]$.
An admissible inversion of $w$ is a pair $(w_i,w_j)$ such that $1\leq i < j\leq k$ and $w_i > w_j$ that satisfies either of the following conditions:
$1 < i$ and $w_{i−1} < w_i$ or there is some $l$ such that $i < l < j$ and $w_i < w_l$.
Let $w = w_1,w_2,\dots,w_k$ be a word of length $k$ with distinct letters from $[n]$.
An admissible inversion of $w$ is a pair $(w_i,w_j)$ such that $1\leq i < j\leq k$ and $w_i > w_j$ that satisfies either of the following conditions:
$1 < i$ and $w_{i−1} < w_i$ or there is some $l$ such that $i < l < j$ and $w_i < w_l$.
Map
cycle-as-one-line notation
Description
Return the permutation obtained by concatenating the cycles of a permutation, each written with minimal element first, sorted by minimal element.
Map
to permutation
Description
Returns the fixed point free involution whose transpositions are the pairs in the perfect matching.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!