Your data matches 51 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00023: Dyck paths to non-crossing permutationPermutations
St000039: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 0
[1,0,1,0]
=> [1,2] => 0
[1,1,0,0]
=> [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => 0
[1,1,0,0,1,0]
=> [2,1,3] => 0
[1,1,0,1,0,0]
=> [2,3,1] => 1
[1,1,1,0,0,0]
=> [3,2,1] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 0
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 0
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 1
Description
The number of crossings of a permutation. A crossing of a permutation $\pi$ is given by a pair $(i,j)$ such that either $i < j \leq \pi(i) \leq \pi(j)$ or $\pi(i) < \pi(j) < i < j$. Pictorially, the diagram of a permutation is obtained by writing the numbers from $1$ to $n$ in this order on a line, and connecting $i$ and $\pi(i)$ with an arc above the line if $i\leq\pi(i)$ and with an arc below the line if $i > \pi(i)$. Then the number of crossings is the number of pairs of arcs above the line that cross or touch, plus the number of arcs below the line that cross.
Mp00023: Dyck paths to non-crossing permutationPermutations
St000731: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 0
[1,0,1,0]
=> [1,2] => 0
[1,1,0,0]
=> [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => 0
[1,1,0,0,1,0]
=> [2,1,3] => 0
[1,1,0,1,0,0]
=> [2,3,1] => 1
[1,1,1,0,0,0]
=> [3,2,1] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 0
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 0
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 1
Description
The number of double exceedences of a permutation. A double exceedence is an index $\sigma(i)$ such that $i < \sigma(i) < \sigma(\sigma(i))$.
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00239: Permutations CorteelPermutations
St000223: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => 0
[1,1,0,0]
=> [2,1] => [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 0
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 0
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => 1
[1,1,1,0,0,0]
=> [3,2,1] => [2,3,1] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,3,4,2] => 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,2,3,1] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,2,4,1] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,3,1,4] => 0
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [2,4,3,1] => 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,3,4,1] => 0
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [3,4,1,2] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,4,5,3] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,4,3,5,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,3,4,2,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,3,5,4,2] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,3,4,5,2] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,4,5,2,3] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,4,5,3] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,2,3,5,1] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,2,4,1,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [3,2,5,4,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,2,4,5,1] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [4,2,5,1,3] => 1
Description
The number of nestings in the permutation.
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00236: Permutations Clarke-Steingrimsson-Zeng inversePermutations
St000366: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => 0
[1,1,0,0]
=> [2,1] => [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 0
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 0
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => 1
[1,1,1,0,0,0]
=> [3,2,1] => [2,3,1] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,3,4,2] => 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,3,2,1] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,4,2,1] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,3,1,4] => 0
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [2,4,3,1] => 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,3,4,1] => 0
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [3,2,4,1] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,4,5,3] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,4,3,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,4,5,3,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,3,4,2,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,3,5,4,2] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,3,4,5,2] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,4,3,5,2] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,4,5,3] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,3,2,1,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,4,3,2,1] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,5,3,2,1] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,4,2,1,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [3,5,4,2,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,4,5,2,1] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [4,3,5,2,1] => 1
Description
The number of double descents of a permutation. A double descent of a permutation $\pi$ is a position $i$ such that $\pi(i) > \pi(i+1) > \pi(i+2)$.
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00239: Permutations CorteelPermutations
St000371: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => 0
[1,1,0,0]
=> [2,1] => [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 0
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 0
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => 1
[1,1,1,0,0,0]
=> [3,2,1] => [2,3,1] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,3,4,2] => 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,2,3,1] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,2,4,1] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,3,1,4] => 0
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [2,4,3,1] => 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,3,4,1] => 0
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [3,4,1,2] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,4,5,3] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,4,3,5,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,3,4,2,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,3,5,4,2] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,3,4,5,2] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,4,5,2,3] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,4,5,3] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,2,3,5,1] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,2,4,1,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [3,2,5,4,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,2,4,5,1] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [4,2,5,1,3] => 1
Description
The number of mid points of decreasing subsequences of length 3 in a permutation. For a permutation $\pi$ of $\{1,\ldots,n\}$, this is the number of indices $j$ such that there exist indices $i,k$ with $i < j < k$ and $\pi(i) > \pi(j) > \pi(k)$. In other words, this is the number of indices that are neither left-to-right maxima nor right-to-left minima. This statistic can also be expressed as the number of occurrences of the mesh pattern ([3,2,1], {(0,2),(0,3),(2,0),(3,0)}): the shading fixes the first and the last element of the decreasing subsequence. See also [[St000119]].
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00239: Permutations CorteelPermutations
St000373: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => 0
[1,1,0,0]
=> [2,1] => [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 0
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 0
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => 1
[1,1,1,0,0,0]
=> [3,2,1] => [2,3,1] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,3,4,2] => 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,2,3,1] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,2,4,1] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,3,1,4] => 0
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [2,4,3,1] => 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,3,4,1] => 0
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [3,4,1,2] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,4,5,3] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,4,3,5,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,3,4,2,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,3,5,4,2] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,3,4,5,2] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,4,5,2,3] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,4,5,3] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,2,3,5,1] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,2,4,1,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [3,2,5,4,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,2,4,5,1] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [4,2,5,1,3] => 1
Description
The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. Given a permutation $\pi = [\pi_1,\ldots,\pi_n]$, this statistic counts the number of position $j$ such that $\pi_j \geq j$ and there exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$. See also [[St000213]] and [[St000119]].
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00227: Dyck paths Delest-Viennot-inverseDyck paths
St001189: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 0
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1
Description
The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000123
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00239: Permutations CorteelPermutations
Mp00066: Permutations inversePermutations
St000123: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => [1,2] => 0
[1,1,0,0]
=> [2,1] => [2,1] => [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => [1,3,2] => 0
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => [2,1,3] => 0
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => [3,2,1] => 1
[1,1,1,0,0,0]
=> [3,2,1] => [2,3,1] => [3,1,2] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => [1,4,3,2] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,3,4,2] => [1,4,2,3] => 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => [3,2,1,4] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,2,3,1] => [4,2,3,1] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,2,4,1] => [4,2,1,3] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,3,1,4] => [3,1,2,4] => 0
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [2,4,3,1] => [4,1,3,2] => 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,3,4,1] => [4,1,2,3] => 0
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [3,4,1,2] => [3,4,1,2] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => [1,2,5,4,3] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,4,5,3] => [1,2,5,3,4] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => [1,5,3,4,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,4,3,5,2] => [1,5,3,2,4] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,3,4,2,5] => [1,4,2,3,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,3,5,4,2] => [1,5,2,4,3] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,3,4,5,2] => [1,5,2,3,4] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,4,5,2,3] => [1,4,5,2,3] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => [2,1,5,4,3] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,4,5,3] => [2,1,5,3,4] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => [3,2,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => [3,2,1,5,4] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => [4,2,3,1,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => [5,2,3,4,1] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,2,3,5,1] => [5,2,3,1,4] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,2,4,1,5] => [4,2,1,3,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [3,2,5,4,1] => [5,2,1,4,3] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,2,4,5,1] => [5,2,1,3,4] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [4,2,5,1,3] => [4,2,5,1,3] => 1
Description
The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. The Simion-Schmidt map takes a permutation and turns each occcurrence of [3,2,1] into an occurrence of [3,1,2], thus reducing the number of inversions of the permutation. This statistic records the difference in length of the permutation and its image. Apparently, this statistic can be described as the number of occurrences of the mesh pattern ([3,2,1], {(0,3),(0,2)}). Equivalent mesh patterns are ([3,2,1], {(0,2),(1,2)}), ([3,2,1], {(0,3),(1,3)}) and ([3,2,1], {(1,2),(1,3)}).
Matching statistic: St000356
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00087: Permutations inverse first fundamental transformationPermutations
Mp00069: Permutations complementPermutations
St000356: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => [2,1] => 0
[1,1,0,0]
=> [2,1] => [2,1] => [1,2] => 0
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [3,2,1] => 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => [3,1,2] => 0
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => [2,3,1] => 0
[1,1,0,1,0,0]
=> [2,3,1] => [3,1,2] => [1,3,2] => 1
[1,1,1,0,0,0]
=> [3,2,1] => [2,3,1] => [2,1,3] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [4,3,2,1] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => [4,3,1,2] => 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => [4,2,3,1] => 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,2,3] => [4,1,3,2] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,3,4,2] => [4,2,1,3] => 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => [3,4,2,1] => 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => [3,4,1,2] => 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1,2,4] => [2,4,3,1] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,1,2,3] => [1,4,3,2] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,4,1,2] => [2,1,4,3] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,3,1,4] => [3,2,4,1] => 0
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [2,4,1,3] => [3,1,4,2] => 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,3,4,1] => [3,2,1,4] => 0
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [3,2,4,1] => [2,3,1,4] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => [5,4,3,1,2] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => [5,4,2,3,1] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,3,4] => [5,4,1,3,2] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,4,5,3] => [5,4,2,1,3] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [5,3,4,2,1] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [5,3,4,1,2] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,2,3,5] => [5,2,4,3,1] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,2,3,4] => [5,1,4,3,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,4,5,2,3] => [5,2,1,4,3] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,3,4,2,5] => [5,3,2,4,1] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,3,5,2,4] => [5,3,1,4,2] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,3,4,5,2] => [5,3,2,1,4] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,4,3,5,2] => [5,2,3,1,4] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [4,5,3,2,1] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [4,5,3,1,2] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [4,5,2,3,1] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,3,4] => [4,5,1,3,2] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,4,5,3] => [4,5,2,1,3] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,2,4,5] => [3,5,4,2,1] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,1,2,5,4] => [3,5,4,1,2] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1,2,3,5] => [2,5,4,3,1] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => [1,5,4,3,2] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,5,1,2,3] => [2,1,5,4,3] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,4,1,2,5] => [3,2,5,4,1] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [3,5,1,2,4] => [3,1,5,4,2] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,4,5,1,2] => [3,2,1,5,4] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [4,3,5,1,2] => [2,3,1,5,4] => 1
Description
The number of occurrences of the pattern 13-2. See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $13\!\!-\!\!2$.
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00140: Dyck paths logarithmic height to pruning numberBinary trees
Mp00012: Binary trees to Dyck path: up step, left tree, down step, right treeDyck paths
St001067: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [[.,.],.]
=> [1,1,0,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [[[.,.],.],.]
=> [1,1,1,0,0,0]
=> 0
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [[[[.,.],.],.],.]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [[[.,.],[.,.]],.]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [[[.,.],.],[.,.]]
=> [1,1,1,0,0,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [[[[[.,.],.],.],.],.]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [[[[.,.],[.,.]],.],.]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [[[.,.],[[.,.],.]],.]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [[[.,[.,.]],[.,.]],.]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [[[[.,.],.],[.,.]],.]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [[.,.],[[[.,.],.],.]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [[.,[[.,.],.]],[.,.]]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [[[.,.],.],[[.,.],.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [[[.,[.,.]],.],[.,.]]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [[[[.,.],.],.],[.,.]]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [[[.,.],[.,.]],[.,.]]
=> [1,1,1,0,0,1,0,0,1,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [[[[[[.,.],.],.],.],.],.]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [[[[[.,.],[.,.]],.],.],.]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [[[[.,.],[[.,.],.]],.],.]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [[[[.,[.,.]],[.,.]],.],.]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [[[[[.,.],.],[.,.]],.],.]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [[[.,.],[[[.,.],.],.]],.]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [[[.,.],[[.,.],[.,.]]],.]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [[[.,[.,.]],[[.,.],.]],.]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [[[.,[.,[.,.]]],[.,.]],.]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [[[.,[[.,.],.]],[.,.]],.]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [[[[.,.],.],[[.,.],.]],.]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [[[[.,[.,.]],.],[.,.]],.]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [[[[[.,.],.],.],[.,.]],.]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [[[[.,.],[.,.]],[.,.]],.]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [[.,.],[[[[.,.],.],.],.]]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [[.,.],[[[.,.],[.,.]],.]]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [[.,.],[[.,.],[[.,.],.]]]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [[.,.],[[.,[.,.]],[.,.]]]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [[.,.],[[[.,.],.],[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [[.,[.,.]],[[[.,.],.],.]]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [[.,[.,.]],[[.,.],[.,.]]]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [[.,[.,[.,.]]],[[.,.],.]]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [[.,[.,[.,[.,.]]]],[.,.]]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [[.,[.,[[.,.],.]]],[.,.]]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [[.,[[.,.],.]],[[.,.],.]]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [[.,[[.,[.,.]],.]],[.,.]]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [[.,[[[.,.],.],.]],[.,.]]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [[.,[[.,.],[.,.]]],[.,.]]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> 1
Description
The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra.
The following 41 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St000317The cycle descent number of a permutation. St000358The number of occurrences of the pattern 31-2. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St000365The number of double ascents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000932The number of occurrences of the pattern UDU in a Dyck path. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St000732The number of double deficiencies of a permutation. St000931The number of occurrences of the pattern UUU in a Dyck path. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001061The number of indices that are both descents and recoils of a permutation. St000485The length of the longest cycle of a permutation. St000237The number of small exceedances. St000649The number of 3-excedences of a permutation. St001624The breadth of a lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000451The length of the longest pattern of the form k 1 2. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St000058The order of a permutation. St001862The number of crossings of a signed permutation. St001866The nesting alignments of a signed permutation. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001095The number of non-isomorphic posets with precisely one further covering relation. St001864The number of excedances of a signed permutation. St001964The interval resolution global dimension of a poset. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001550The number of inversions between exceedances where the greater exceedance is linked. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001394The genus of a permutation. St000352The Elizalde-Pak rank of a permutation.