Identifier
Values
[1] => [1,0,1,0] => [(1,2),(3,4)] => [2,1,4,3] => 1
[2] => [1,1,0,0,1,0] => [(1,4),(2,3),(5,6)] => [4,3,2,1,6,5] => 3
[1,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => [2,1,6,5,4,3] => 1
[2,1] => [1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => [2,1,4,3,6,5] => 1
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
click to show known generating functions       
Description
The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right.
For a permutation $\pi$ of length $n$, this is the number of indices $2 \leq j \leq n$ such that for all $1 \leq i < j$, the pair $(i,j)$ is an inversion of $\pi$.
Map
to tunnel matching
Description
Sends a Dyck path of semilength n to the noncrossing perfect matching given by matching an up-step with the corresponding down-step.
This is, for a Dyck path $D$ of semilength $n$, the perfect matching of $\{1,\dots,2n\}$ with $i < j$ being matched if $D_i$ is an up-step and $D_j$ is the down-step connected to $D_i$ by a tunnel.
Map
to permutation
Description
Returns the fixed point free involution whose transpositions are the pairs in the perfect matching.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.