Your data matches 201 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001296
(load all 10 compositions to match this statistic)
Mapping
St001296: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => 0 = 1 - 1
[1,0,1,0]
 => 1 = 2 - 1
[1,1,0,0]
 => 0 = 1 - 1
[1,0,1,0,1,0]
 => 2 = 3 - 1
[1,0,1,1,0,0]
 => 1 = 2 - 1
[1,1,0,0,1,0]
 => 1 = 2 - 1
[1,1,0,1,0,0]
 => 1 = 2 - 1
[1,1,1,0,0,0]
 => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
 => 3 = 4 - 1
[1,0,1,0,1,1,0,0]
 => 2 = 3 - 1
[1,0,1,1,0,0,1,0]
 => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
 => 2 = 3 - 1
[1,0,1,1,1,0,0,0]
 => 1 = 2 - 1
[1,1,0,0,1,0,1,0]
 => 2 = 3 - 1
[1,1,0,0,1,1,0,0]
 => 1 = 2 - 1
[1,1,0,1,0,0,1,0]
 => 2 = 3 - 1
[1,1,0,1,0,1,0,0]
 => 2 = 3 - 1
[1,1,0,1,1,0,0,0]
 => 1 = 2 - 1
[1,1,1,0,0,0,1,0]
 => 1 = 2 - 1
[1,1,1,0,0,1,0,0]
 => 1 = 2 - 1
[1,1,1,0,1,0,0,0]
 => 1 = 2 - 1
[1,1,1,1,0,0,0,0]
 => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
 => 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,0]
 => 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0]
 => 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0]
 => 3 = 4 - 1
[1,0,1,0,1,1,1,0,0,0]
 => 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
 => 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
 => 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
 => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
 => 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
 => 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
 => 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
 => 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
 => 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
 => 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
 => 3 = 4 - 1
[1,1,0,0,1,0,1,1,0,0]
 => 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
 => 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
 => 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
 => 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
 => 3 = 4 - 1
[1,1,0,1,0,0,1,1,0,0]
 => 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
 => 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
 => 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
 => 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
 => 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
 => 2 = 3 - 1
[1,1,0,1,1,0,1,0,0,0]
 => 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
 => 1 = 2 - 1
Description
The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. See [[http://www.findstat.org/DyckPaths/NakayamaAlgebras]].
Matching statistic: St000308
(load all 4 compositions to match this statistic)
Mapping
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
St000308: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1] => [1] => 1
[1,0,1,0]
 => [1,2] => [2,1] => 1
[1,1,0,0]
 => [2,1] => [1,2] => 2
[1,0,1,0,1,0]
 => [1,2,3] => [3,2,1] => 1
[1,0,1,1,0,0]
 => [1,3,2] => [2,3,1] => 2
[1,1,0,0,1,0]
 => [2,1,3] => [3,1,2] => 2
[1,1,0,1,0,0]
 => [2,3,1] => [1,3,2] => 2
[1,1,1,0,0,0]
 => [3,2,1] => [1,2,3] => 3
[1,0,1,0,1,0,1,0]
 => [1,2,3,4] => [4,3,2,1] => 1
[1,0,1,0,1,1,0,0]
 => [1,2,4,3] => [3,4,2,1] => 2
[1,0,1,1,0,0,1,0]
 => [1,3,2,4] => [4,2,3,1] => 2
[1,0,1,1,0,1,0,0]
 => [1,3,4,2] => [2,4,3,1] => 2
[1,0,1,1,1,0,0,0]
 => [1,4,3,2] => [2,3,4,1] => 3
[1,1,0,0,1,0,1,0]
 => [2,1,3,4] => [4,3,1,2] => 2
[1,1,0,0,1,1,0,0]
 => [2,1,4,3] => [3,4,1,2] => 2
[1,1,0,1,0,0,1,0]
 => [2,3,1,4] => [4,1,3,2] => 2
[1,1,0,1,0,1,0,0]
 => [2,3,4,1] => [1,4,3,2] => 2
[1,1,0,1,1,0,0,0]
 => [2,4,3,1] => [1,3,4,2] => 3
[1,1,1,0,0,0,1,0]
 => [3,2,1,4] => [4,1,2,3] => 3
[1,1,1,0,0,1,0,0]
 => [3,2,4,1] => [1,4,2,3] => 3
[1,1,1,0,1,0,0,0]
 => [4,2,3,1] => [1,3,2,4] => 3
[1,1,1,1,0,0,0,0]
 => [4,3,2,1] => [1,2,3,4] => 4
[1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => [5,4,3,2,1] => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => [4,5,3,2,1] => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => [5,3,4,2,1] => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => [3,5,4,2,1] => 2
[1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,4,3] => [3,4,5,2,1] => 3
[1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => [5,4,2,3,1] => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => [4,5,2,3,1] => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => [5,2,4,3,1] => 2
[1,0,1,1,0,1,0,1,0,0]
 => [1,3,4,5,2] => [2,5,4,3,1] => 2
[1,0,1,1,0,1,1,0,0,0]
 => [1,3,5,4,2] => [2,4,5,3,1] => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,4,3,2,5] => [5,2,3,4,1] => 3
[1,0,1,1,1,0,0,1,0,0]
 => [1,4,3,5,2] => [2,5,3,4,1] => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,5,3,4,2] => [2,4,3,5,1] => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,5,4,3,2] => [2,3,4,5,1] => 4
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => [5,4,3,1,2] => 2
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => [4,5,3,1,2] => 2
[1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => [5,3,4,1,2] => 2
[1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => [3,5,4,1,2] => 2
[1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,4,3] => [3,4,5,1,2] => 3
[1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => [5,4,1,3,2] => 2
[1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => [4,5,1,3,2] => 2
[1,1,0,1,0,1,0,0,1,0]
 => [2,3,4,1,5] => [5,1,4,3,2] => 2
[1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => [1,5,4,3,2] => 2
[1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,4,1] => [1,4,5,3,2] => 3
[1,1,0,1,1,0,0,0,1,0]
 => [2,4,3,1,5] => [5,1,3,4,2] => 3
[1,1,0,1,1,0,0,1,0,0]
 => [2,4,3,5,1] => [1,5,3,4,2] => 3
[1,1,0,1,1,0,1,0,0,0]
 => [2,5,3,4,1] => [1,4,3,5,2] => 3
[1,1,0,1,1,1,0,0,0,0]
 => [2,5,4,3,1] => [1,3,4,5,2] => 4
Description
The height of the tree associated to a permutation. A permutation can be mapped to a rooted tree with vertices $\{0,1,2,\ldots,n\}$ and root $0$ in the following way. Entries of the permutations are inserted one after the other, each child is larger than its parent and the children are in strict order from left to right. Details of the construction are found in [1]. The statistic is given by the height of this tree. See also [[St000325]] for the width of this tree.
Matching statistic: St000451
(load all 21 compositions to match this statistic)
Mapping
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00241: Permutations —invert Laguerre heap⟶ Permutations
St000451: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1] => [1] => 1
[1,0,1,0]
 => [1,2] => [1,2] => 1
[1,1,0,0]
 => [2,1] => [2,1] => 2
[1,0,1,0,1,0]
 => [1,2,3] => [1,2,3] => 1
[1,0,1,1,0,0]
 => [1,3,2] => [1,3,2] => 2
[1,1,0,0,1,0]
 => [2,1,3] => [2,1,3] => 2
[1,1,0,1,0,0]
 => [2,3,1] => [3,1,2] => 3
[1,1,1,0,0,0]
 => [3,1,2] => [2,3,1] => 2
[1,0,1,0,1,0,1,0]
 => [1,2,3,4] => [1,2,3,4] => 1
[1,0,1,0,1,1,0,0]
 => [1,2,4,3] => [1,2,4,3] => 2
[1,0,1,1,0,0,1,0]
 => [1,3,2,4] => [1,3,2,4] => 2
[1,0,1,1,0,1,0,0]
 => [1,3,4,2] => [1,4,2,3] => 3
[1,0,1,1,1,0,0,0]
 => [1,4,2,3] => [1,3,4,2] => 2
[1,1,0,0,1,0,1,0]
 => [2,1,3,4] => [2,1,3,4] => 2
[1,1,0,0,1,1,0,0]
 => [2,1,4,3] => [2,1,4,3] => 2
[1,1,0,1,0,0,1,0]
 => [2,3,1,4] => [3,1,2,4] => 3
[1,1,0,1,0,1,0,0]
 => [2,3,4,1] => [4,1,2,3] => 4
[1,1,0,1,1,0,0,0]
 => [2,4,1,3] => [3,4,1,2] => 3
[1,1,1,0,0,0,1,0]
 => [3,1,2,4] => [2,3,1,4] => 2
[1,1,1,0,0,1,0,0]
 => [3,1,4,2] => [4,2,3,1] => 3
[1,1,1,0,1,0,0,0]
 => [3,4,1,2] => [2,4,1,3] => 3
[1,1,1,1,0,0,0,0]
 => [4,1,2,3] => [2,3,4,1] => 2
[1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => [1,2,3,4,5] => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => [1,2,3,5,4] => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => [1,2,4,3,5] => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => [1,2,5,3,4] => 3
[1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,3,4] => [1,2,4,5,3] => 2
[1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => [1,3,2,4,5] => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => [1,3,2,5,4] => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => [1,4,2,3,5] => 3
[1,0,1,1,0,1,0,1,0,0]
 => [1,3,4,5,2] => [1,5,2,3,4] => 4
[1,0,1,1,0,1,1,0,0,0]
 => [1,3,5,2,4] => [1,4,5,2,3] => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,4,2,3,5] => [1,3,4,2,5] => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,4,2,5,3] => [1,5,3,4,2] => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,4,5,2,3] => [1,3,5,2,4] => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,5,2,3,4] => [1,3,4,5,2] => 2
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => [2,1,3,4,5] => 2
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => [2,1,3,5,4] => 2
[1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => [2,1,4,3,5] => 2
[1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => [2,1,5,3,4] => 3
[1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,3,4] => [2,1,4,5,3] => 2
[1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => [3,1,2,4,5] => 3
[1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => [3,1,2,5,4] => 3
[1,1,0,1,0,1,0,0,1,0]
 => [2,3,4,1,5] => [4,1,2,3,5] => 4
[1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => [5,1,2,3,4] => 5
[1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,1,4] => [4,5,1,2,3] => 4
[1,1,0,1,1,0,0,0,1,0]
 => [2,4,1,3,5] => [3,4,1,2,5] => 3
[1,1,0,1,1,0,0,1,0,0]
 => [2,4,1,5,3] => [5,3,4,1,2] => 3
[1,1,0,1,1,0,1,0,0,0]
 => [2,4,5,1,3] => [3,5,1,2,4] => 4
[1,1,0,1,1,1,0,0,0,0]
 => [2,5,1,3,4] => [3,4,5,1,2] => 3
Description
The length of the longest pattern of the form k 1 2...(k-1).
Matching statistic: St000028
(load all 5 compositions to match this statistic)
Mapping
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00241: Permutations —invert Laguerre heap⟶ Permutations
St000028: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1] => [1] => 0 = 1 - 1
[1,0,1,0]
 => [1,2] => [1,2] => 0 = 1 - 1
[1,1,0,0]
 => [2,1] => [2,1] => 1 = 2 - 1
[1,0,1,0,1,0]
 => [1,2,3] => [1,2,3] => 0 = 1 - 1
[1,0,1,1,0,0]
 => [1,3,2] => [1,3,2] => 1 = 2 - 1
[1,1,0,0,1,0]
 => [2,1,3] => [2,1,3] => 1 = 2 - 1
[1,1,0,1,0,0]
 => [2,3,1] => [3,1,2] => 1 = 2 - 1
[1,1,1,0,0,0]
 => [3,1,2] => [2,3,1] => 2 = 3 - 1
[1,0,1,0,1,0,1,0]
 => [1,2,3,4] => [1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,1,0,0]
 => [1,2,4,3] => [1,2,4,3] => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
 => [1,3,2,4] => [1,3,2,4] => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
 => [1,3,4,2] => [1,4,2,3] => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
 => [1,4,2,3] => [1,3,4,2] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
 => [2,1,3,4] => [2,1,3,4] => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
 => [2,1,4,3] => [2,1,4,3] => 1 = 2 - 1
[1,1,0,1,0,0,1,0]
 => [2,3,1,4] => [3,1,2,4] => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
 => [2,3,4,1] => [4,1,2,3] => 1 = 2 - 1
[1,1,0,1,1,0,0,0]
 => [2,4,1,3] => [3,4,1,2] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
 => [3,1,2,4] => [2,3,1,4] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
 => [3,1,4,2] => [4,2,3,1] => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
 => [3,4,1,2] => [2,4,1,3] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
 => [4,1,2,3] => [2,3,4,1] => 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => [1,2,3,5,4] => 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => [1,2,4,3,5] => 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => [1,2,5,3,4] => 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,3,4] => [1,2,4,5,3] => 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => [1,3,2,4,5] => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => [1,3,2,5,4] => 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => [1,4,2,3,5] => 1 = 2 - 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,3,4,5,2] => [1,5,2,3,4] => 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,3,5,2,4] => [1,4,5,2,3] => 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,4,2,3,5] => [1,3,4,2,5] => 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
 => [1,4,2,5,3] => [1,5,3,4,2] => 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
 => [1,4,5,2,3] => [1,3,5,2,4] => 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,5,2,3,4] => [1,3,4,5,2] => 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => [2,1,3,4,5] => 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => [2,1,3,5,4] => 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => [2,1,4,3,5] => 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => [2,1,5,3,4] => 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,3,4] => [2,1,4,5,3] => 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => [3,1,2,4,5] => 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => [3,1,2,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] => 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => [5,1,2,3,4] => 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,1,4] => [4,5,1,2,3] => 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
 => [2,4,1,3,5] => [3,4,1,2,5] => 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
 => [2,4,1,5,3] => [5,3,4,1,2] => 2 = 3 - 1
[1,1,0,1,1,0,1,0,0,0]
 => [2,4,5,1,3] => [3,5,1,2,4] => 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
 => [2,5,1,3,4] => [3,4,5,1,2] => 3 = 4 - 1
Description
The number of stack-sorts needed to sort a permutation. A permutation is (West) $t$-stack sortable if it is sortable using $t$ stacks in series. Let $W_t(n,k)$ be the number of permutations of size $n$ with $k$ descents which are $t$-stack sortable. Then the polynomials $W_{n,t}(x) = \sum_{k=0}^n W_t(n,k)x^k$ are symmetric and unimodal. We have $W_{n,1}(x) = A_n(x)$, the Eulerian polynomials. One can show that $W_{n,1}(x)$ and $W_{n,2}(x)$ are real-rooted. Precisely the permutations that avoid the pattern $231$ have statistic at most $1$, see [3]. These are counted by $\frac{1}{n+1}\binom{2n}{n}$ ([[OEIS:A000108]]). Precisely the permutations that avoid the pattern $2341$ and the barred pattern $3\bar 5241$ have statistic at most $2$, see [4]. These are counted by $\frac{2(3n)!}{(n+1)!(2n+1)!}$ ([[OEIS:A000139]]).
Matching statistic: St000845
(load all 8 compositions to match this statistic)
Mapping
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000845: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1] => ([],1)
 => 0 = 1 - 1
[1,0,1,0]
 => [1,2] => ([(0,1)],2)
 => 1 = 2 - 1
[1,1,0,0]
 => [2,1] => ([],2)
 => 0 = 1 - 1
[1,0,1,0,1,0]
 => [1,2,3] => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
[1,0,1,1,0,0]
 => [1,3,2] => ([(0,1),(0,2)],3)
 => 2 = 3 - 1
[1,1,0,0,1,0]
 => [2,1,3] => ([(0,2),(1,2)],3)
 => 1 = 2 - 1
[1,1,0,1,0,0]
 => [2,3,1] => ([(1,2)],3)
 => 1 = 2 - 1
[1,1,1,0,0,0]
 => [3,2,1] => ([],3)
 => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
 => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
 => 1 = 2 - 1
[1,0,1,0,1,1,0,0]
 => [1,2,4,3] => ([(0,3),(3,1),(3,2)],4)
 => 2 = 3 - 1
[1,0,1,1,0,0,1,0]
 => [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 2 = 3 - 1
[1,0,1,1,0,1,0,0]
 => [1,3,4,2] => ([(0,2),(0,3),(3,1)],4)
 => 2 = 3 - 1
[1,0,1,1,1,0,0,0]
 => [1,4,3,2] => ([(0,1),(0,2),(0,3)],4)
 => 3 = 4 - 1
[1,1,0,0,1,0,1,0]
 => [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
 => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
 => [2,1,4,3] => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
 => [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
 => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
 => [2,3,4,1] => ([(1,2),(2,3)],4)
 => 1 = 2 - 1
[1,1,0,1,1,0,0,0]
 => [2,4,3,1] => ([(1,2),(1,3)],4)
 => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
 => [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
 => 1 = 2 - 1
[1,1,1,0,0,1,0,0]
 => [3,2,4,1] => ([(1,3),(2,3)],4)
 => 1 = 2 - 1
[1,1,1,0,1,0,0,0]
 => [4,2,3,1] => ([(2,3)],4)
 => 1 = 2 - 1
[1,1,1,1,0,0,0,0]
 => [4,3,2,1] => ([],4)
 => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => ([(0,3),(3,4),(4,1),(4,2)],5)
 => 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => ([(0,4),(3,2),(4,1),(4,3)],5)
 => 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,4,3] => ([(0,4),(4,1),(4,2),(4,3)],5)
 => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,3,4,5,2] => ([(0,2),(0,4),(3,1),(4,3)],5)
 => 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,3,5,4,2] => ([(0,3),(0,4),(4,1),(4,2)],5)
 => 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
 => [1,4,3,2,5] => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => 3 = 4 - 1
[1,0,1,1,1,0,0,1,0,0]
 => [1,4,3,5,2] => ([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
 => 3 = 4 - 1
[1,0,1,1,1,0,1,0,0,0]
 => [1,5,3,4,2] => ([(0,2),(0,3),(0,4),(4,1)],5)
 => 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
 => [1,5,4,3,2] => ([(0,1),(0,2),(0,3),(0,4)],5)
 => 4 = 5 - 1
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => ([(0,4),(1,4),(2,3),(4,2)],5)
 => 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => ([(0,4),(1,4),(4,2),(4,3)],5)
 => 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
 => 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
 => 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,4,3] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
 => 3 = 4 - 1
[1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => ([(0,4),(1,2),(2,4),(4,3)],5)
 => 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
 => 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
 => [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => ([(1,4),(3,2),(4,3)],5)
 => 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,4,1] => ([(1,4),(4,2),(4,3)],5)
 => 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
 => [2,4,3,1,5] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
 => [2,4,3,5,1] => ([(1,2),(1,3),(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,1,0,1,1,0,1,0,0,0]
 => [2,5,3,4,1] => ([(1,3),(1,4),(4,2)],5)
 => 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
 => [2,5,4,3,1] => ([(1,2),(1,3),(1,4)],5)
 => 3 = 4 - 1
Description
The maximal number of elements covered by an element in a poset.
Matching statistic: St000846
(load all 10 compositions to match this statistic)
Mapping
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000846: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1] => ([],1)
 => 0 = 1 - 1
[1,0,1,0]
 => [2,1] => ([],2)
 => 0 = 1 - 1
[1,1,0,0]
 => [1,2] => ([(0,1)],2)
 => 1 = 2 - 1
[1,0,1,0,1,0]
 => [3,2,1] => ([],3)
 => 0 = 1 - 1
[1,0,1,1,0,0]
 => [2,3,1] => ([(1,2)],3)
 => 1 = 2 - 1
[1,1,0,0,1,0]
 => [3,1,2] => ([(1,2)],3)
 => 1 = 2 - 1
[1,1,0,1,0,0]
 => [2,1,3] => ([(0,2),(1,2)],3)
 => 2 = 3 - 1
[1,1,1,0,0,0]
 => [1,2,3] => ([(0,2),(2,1)],3)
 => 1 = 2 - 1
[1,0,1,0,1,0,1,0]
 => [4,3,2,1] => ([],4)
 => 0 = 1 - 1
[1,0,1,0,1,1,0,0]
 => [3,4,2,1] => ([(2,3)],4)
 => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
 => [4,2,3,1] => ([(2,3)],4)
 => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
 => [3,2,4,1] => ([(1,3),(2,3)],4)
 => 2 = 3 - 1
[1,0,1,1,1,0,0,0]
 => [2,3,4,1] => ([(1,2),(2,3)],4)
 => 1 = 2 - 1
[1,1,0,0,1,0,1,0]
 => [4,3,1,2] => ([(2,3)],4)
 => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
 => [3,4,1,2] => ([(0,3),(1,2)],4)
 => 1 = 2 - 1
[1,1,0,1,0,0,1,0]
 => [4,2,1,3] => ([(1,3),(2,3)],4)
 => 2 = 3 - 1
[1,1,0,1,0,1,0,0]
 => [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
 => 3 = 4 - 1
[1,1,0,1,1,0,0,0]
 => [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
 => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
 => [4,1,2,3] => ([(1,2),(2,3)],4)
 => 1 = 2 - 1
[1,1,1,0,0,1,0,0]
 => [3,1,2,4] => ([(0,3),(1,2),(2,3)],4)
 => 2 = 3 - 1
[1,1,1,0,1,0,0,0]
 => [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
 => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
 => [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
 => 1 = 2 - 1
[1,0,1,0,1,0,1,0,1,0]
 => [5,4,3,2,1] => ([],5)
 => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
 => [4,5,3,2,1] => ([(3,4)],5)
 => 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
 => [5,3,4,2,1] => ([(3,4)],5)
 => 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
 => [4,3,5,2,1] => ([(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
 => [3,4,5,2,1] => ([(2,3),(3,4)],5)
 => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
 => [5,4,2,3,1] => ([(3,4)],5)
 => 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
 => [4,5,2,3,1] => ([(1,4),(2,3)],5)
 => 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
 => [5,3,2,4,1] => ([(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
 => [4,3,2,5,1] => ([(1,4),(2,4),(3,4)],5)
 => 3 = 4 - 1
[1,0,1,1,0,1,1,0,0,0]
 => [3,4,2,5,1] => ([(1,4),(2,3),(3,4)],5)
 => 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
 => [5,2,3,4,1] => ([(2,3),(3,4)],5)
 => 1 = 2 - 1
[1,0,1,1,1,0,0,1,0,0]
 => [4,2,3,5,1] => ([(1,4),(2,3),(3,4)],5)
 => 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
 => [3,2,4,5,1] => ([(1,4),(2,4),(4,3)],5)
 => 2 = 3 - 1
[1,0,1,1,1,1,0,0,0,0]
 => [2,3,4,5,1] => ([(1,4),(3,2),(4,3)],5)
 => 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
 => [5,4,3,1,2] => ([(3,4)],5)
 => 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
 => [4,5,3,1,2] => ([(1,4),(2,3)],5)
 => 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
 => [5,3,4,1,2] => ([(1,4),(2,3)],5)
 => 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
 => [4,3,5,1,2] => ([(0,4),(1,4),(2,3)],5)
 => 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
 => [3,4,5,1,2] => ([(0,3),(1,4),(4,2)],5)
 => 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
 => [5,4,2,1,3] => ([(2,4),(3,4)],5)
 => 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
 => [4,5,2,1,3] => ([(0,4),(1,4),(2,3)],5)
 => 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
 => [5,3,2,1,4] => ([(1,4),(2,4),(3,4)],5)
 => 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
 => [4,3,2,1,5] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => 4 = 5 - 1
[1,1,0,1,0,1,1,0,0,0]
 => [3,4,2,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 3 = 4 - 1
[1,1,0,1,1,0,0,0,1,0]
 => [5,2,3,1,4] => ([(1,4),(2,3),(3,4)],5)
 => 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
 => [4,2,3,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
 => 3 = 4 - 1
[1,1,0,1,1,0,1,0,0,0]
 => [3,2,4,1,5] => ([(0,4),(1,3),(2,3),(3,4)],5)
 => 2 = 3 - 1
[1,1,0,1,1,1,0,0,0,0]
 => [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
 => 2 = 3 - 1
Description
The maximal number of elements covering an element of a poset.
Matching statistic: St000013
(load all 2 compositions to match this statistic)
Mapping
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000013: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1] => [.,.]
 => [1,0]
 => 1
[1,0,1,0]
 => [1,2] => [.,[.,.]]
 => [1,0,1,0]
 => 1
[1,1,0,0]
 => [2,1] => [[.,.],.]
 => [1,1,0,0]
 => 2
[1,0,1,0,1,0]
 => [1,2,3] => [.,[.,[.,.]]]
 => [1,0,1,0,1,0]
 => 1
[1,0,1,1,0,0]
 => [1,3,2] => [.,[[.,.],.]]
 => [1,0,1,1,0,0]
 => 2
[1,1,0,0,1,0]
 => [2,1,3] => [[.,.],[.,.]]
 => [1,1,0,0,1,0]
 => 2
[1,1,0,1,0,0]
 => [2,3,1] => [[.,[.,.]],.]
 => [1,1,0,1,0,0]
 => 2
[1,1,1,0,0,0]
 => [3,2,1] => [[[.,.],.],.]
 => [1,1,1,0,0,0]
 => 3
[1,0,1,0,1,0,1,0]
 => [1,2,3,4] => [.,[.,[.,[.,.]]]]
 => [1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0]
 => [1,2,4,3] => [.,[.,[[.,.],.]]]
 => [1,0,1,0,1,1,0,0]
 => 2
[1,0,1,1,0,0,1,0]
 => [1,3,2,4] => [.,[[.,.],[.,.]]]
 => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,3,4,2] => [.,[[.,[.,.]],.]]
 => [1,0,1,1,0,1,0,0]
 => 2
[1,0,1,1,1,0,0,0]
 => [1,4,3,2] => [.,[[[.,.],.],.]]
 => [1,0,1,1,1,0,0,0]
 => 3
[1,1,0,0,1,0,1,0]
 => [2,1,3,4] => [[.,.],[.,[.,.]]]
 => [1,1,0,0,1,0,1,0]
 => 2
[1,1,0,0,1,1,0,0]
 => [2,1,4,3] => [[.,.],[[.,.],.]]
 => [1,1,0,0,1,1,0,0]
 => 2
[1,1,0,1,0,0,1,0]
 => [2,3,1,4] => [[.,[.,.]],[.,.]]
 => [1,1,0,1,0,0,1,0]
 => 2
[1,1,0,1,0,1,0,0]
 => [2,3,4,1] => [[.,[.,[.,.]]],.]
 => [1,1,0,1,0,1,0,0]
 => 2
[1,1,0,1,1,0,0,0]
 => [2,4,3,1] => [[.,[[.,.],.]],.]
 => [1,1,0,1,1,0,0,0]
 => 3
[1,1,1,0,0,0,1,0]
 => [3,2,1,4] => [[[.,.],.],[.,.]]
 => [1,1,1,0,0,0,1,0]
 => 3
[1,1,1,0,0,1,0,0]
 => [3,2,4,1] => [[[.,.],[.,.]],.]
 => [1,1,1,0,0,1,0,0]
 => 3
[1,1,1,0,1,0,0,0]
 => [4,2,3,1] => [[[.,.],[.,.]],.]
 => [1,1,1,0,0,1,0,0]
 => 3
[1,1,1,1,0,0,0,0]
 => [4,3,2,1] => [[[[.,.],.],.],.]
 => [1,1,1,1,0,0,0,0]
 => 4
[1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
 => [1,0,1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
 => [1,0,1,0,1,0,1,1,0,0]
 => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
 => [1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
 => [1,0,1,0,1,1,0,1,0,0]
 => 2
[1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
 => [1,0,1,0,1,1,1,0,0,0]
 => 3
[1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
 => [1,0,1,1,0,0,1,0,1,0]
 => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
 => [1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
 => [1,0,1,1,0,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,1,0,0]
 => [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
 => [1,0,1,1,0,1,0,1,0,0]
 => 2
[1,0,1,1,0,1,1,0,0,0]
 => [1,3,5,4,2] => [.,[[.,[[.,.],.]],.]]
 => [1,0,1,1,0,1,1,0,0,0]
 => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,4,3,2,5] => [.,[[[.,.],.],[.,.]]]
 => [1,0,1,1,1,0,0,0,1,0]
 => 3
[1,0,1,1,1,0,0,1,0,0]
 => [1,4,3,5,2] => [.,[[[.,.],[.,.]],.]]
 => [1,0,1,1,1,0,0,1,0,0]
 => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,5,3,4,2] => [.,[[[.,.],[.,.]],.]]
 => [1,0,1,1,1,0,0,1,0,0]
 => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,5,4,3,2] => [.,[[[[.,.],.],.],.]]
 => [1,0,1,1,1,1,0,0,0,0]
 => 4
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
 => [1,1,0,0,1,0,1,0,1,0]
 => 2
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
 => [1,1,0,0,1,0,1,1,0,0]
 => 2
[1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
 => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
 => [1,1,0,0,1,1,0,1,0,0]
 => 2
[1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,4,3] => [[.,.],[[[.,.],.],.]]
 => [1,1,0,0,1,1,1,0,0,0]
 => 3
[1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
 => [1,1,0,1,0,0,1,0,1,0]
 => 2
[1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
 => [1,1,0,1,0,0,1,1,0,0]
 => 2
[1,1,0,1,0,1,0,0,1,0]
 => [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
 => [1,1,0,1,0,1,0,0,1,0]
 => 2
[1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
 => [1,1,0,1,0,1,0,1,0,0]
 => 2
[1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,4,1] => [[.,[.,[[.,.],.]]],.]
 => [1,1,0,1,0,1,1,0,0,0]
 => 3
[1,1,0,1,1,0,0,0,1,0]
 => [2,4,3,1,5] => [[.,[[.,.],.]],[.,.]]
 => [1,1,0,1,1,0,0,0,1,0]
 => 3
[1,1,0,1,1,0,0,1,0,0]
 => [2,4,3,5,1] => [[.,[[.,.],[.,.]]],.]
 => [1,1,0,1,1,0,0,1,0,0]
 => 3
[1,1,0,1,1,0,1,0,0,0]
 => [2,5,3,4,1] => [[.,[[.,.],[.,.]]],.]
 => [1,1,0,1,1,0,0,1,0,0]
 => 3
[1,1,0,1,1,1,0,0,0,0]
 => [2,5,4,3,1] => [[.,[[[.,.],.],.]],.]
 => [1,1,0,1,1,1,0,0,0,0]
 => 4
Description
The height of a Dyck path. The height of a Dyck path $D$ of semilength $n$ is defined as the maximal height of a peak of $D$. The height of $D$ at position $i$ is the number of up-steps minus the number of down-steps before position $i$.
Matching statistic: St000062
(load all 2 compositions to match this statistic)
Mapping
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00014: Binary trees —to 132-avoiding permutation⟶ Permutations
St000062: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1] => [.,.]
 => [1] => 1
[1,0,1,0]
 => [1,2] => [.,[.,.]]
 => [2,1] => 1
[1,1,0,0]
 => [2,1] => [[.,.],.]
 => [1,2] => 2
[1,0,1,0,1,0]
 => [1,2,3] => [.,[.,[.,.]]]
 => [3,2,1] => 1
[1,0,1,1,0,0]
 => [1,3,2] => [.,[[.,.],.]]
 => [2,3,1] => 2
[1,1,0,0,1,0]
 => [2,1,3] => [[.,.],[.,.]]
 => [3,1,2] => 2
[1,1,0,1,0,0]
 => [2,3,1] => [[.,[.,.]],.]
 => [2,1,3] => 2
[1,1,1,0,0,0]
 => [3,2,1] => [[[.,.],.],.]
 => [1,2,3] => 3
[1,0,1,0,1,0,1,0]
 => [1,2,3,4] => [.,[.,[.,[.,.]]]]
 => [4,3,2,1] => 1
[1,0,1,0,1,1,0,0]
 => [1,2,4,3] => [.,[.,[[.,.],.]]]
 => [3,4,2,1] => 2
[1,0,1,1,0,0,1,0]
 => [1,3,2,4] => [.,[[.,.],[.,.]]]
 => [4,2,3,1] => 2
[1,0,1,1,0,1,0,0]
 => [1,3,4,2] => [.,[[.,[.,.]],.]]
 => [3,2,4,1] => 2
[1,0,1,1,1,0,0,0]
 => [1,4,3,2] => [.,[[[.,.],.],.]]
 => [2,3,4,1] => 3
[1,1,0,0,1,0,1,0]
 => [2,1,3,4] => [[.,.],[.,[.,.]]]
 => [4,3,1,2] => 2
[1,1,0,0,1,1,0,0]
 => [2,1,4,3] => [[.,.],[[.,.],.]]
 => [3,4,1,2] => 2
[1,1,0,1,0,0,1,0]
 => [2,3,1,4] => [[.,[.,.]],[.,.]]
 => [4,2,1,3] => 2
[1,1,0,1,0,1,0,0]
 => [2,3,4,1] => [[.,[.,[.,.]]],.]
 => [3,2,1,4] => 2
[1,1,0,1,1,0,0,0]
 => [2,4,3,1] => [[.,[[.,.],.]],.]
 => [2,3,1,4] => 3
[1,1,1,0,0,0,1,0]
 => [3,2,1,4] => [[[.,.],.],[.,.]]
 => [4,1,2,3] => 3
[1,1,1,0,0,1,0,0]
 => [3,2,4,1] => [[[.,.],[.,.]],.]
 => [3,1,2,4] => 3
[1,1,1,0,1,0,0,0]
 => [4,2,3,1] => [[[.,.],[.,.]],.]
 => [3,1,2,4] => 3
[1,1,1,1,0,0,0,0]
 => [4,3,2,1] => [[[[.,.],.],.],.]
 => [1,2,3,4] => 4
[1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
 => [5,4,3,2,1] => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
 => [4,5,3,2,1] => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
 => [5,3,4,2,1] => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
 => [4,3,5,2,1] => 2
[1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
 => [3,4,5,2,1] => 3
[1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
 => [5,4,2,3,1] => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
 => [4,5,2,3,1] => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
 => [5,3,2,4,1] => 2
[1,0,1,1,0,1,0,1,0,0]
 => [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
 => [4,3,2,5,1] => 2
[1,0,1,1,0,1,1,0,0,0]
 => [1,3,5,4,2] => [.,[[.,[[.,.],.]],.]]
 => [3,4,2,5,1] => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,4,3,2,5] => [.,[[[.,.],.],[.,.]]]
 => [5,2,3,4,1] => 3
[1,0,1,1,1,0,0,1,0,0]
 => [1,4,3,5,2] => [.,[[[.,.],[.,.]],.]]
 => [4,2,3,5,1] => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,5,3,4,2] => [.,[[[.,.],[.,.]],.]]
 => [4,2,3,5,1] => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,5,4,3,2] => [.,[[[[.,.],.],.],.]]
 => [2,3,4,5,1] => 4
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
 => [5,4,3,1,2] => 2
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
 => [4,5,3,1,2] => 2
[1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
 => [5,3,4,1,2] => 2
[1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
 => [4,3,5,1,2] => 2
[1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,4,3] => [[.,.],[[[.,.],.],.]]
 => [3,4,5,1,2] => 3
[1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
 => [5,4,2,1,3] => 2
[1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
 => [4,5,2,1,3] => 2
[1,1,0,1,0,1,0,0,1,0]
 => [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
 => [5,3,2,1,4] => 2
[1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
 => [4,3,2,1,5] => 2
[1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,4,1] => [[.,[.,[[.,.],.]]],.]
 => [3,4,2,1,5] => 3
[1,1,0,1,1,0,0,0,1,0]
 => [2,4,3,1,5] => [[.,[[.,.],.]],[.,.]]
 => [5,2,3,1,4] => 3
[1,1,0,1,1,0,0,1,0,0]
 => [2,4,3,5,1] => [[.,[[.,.],[.,.]]],.]
 => [4,2,3,1,5] => 3
[1,1,0,1,1,0,1,0,0,0]
 => [2,5,3,4,1] => [[.,[[.,.],[.,.]]],.]
 => [4,2,3,1,5] => 3
[1,1,0,1,1,1,0,0,0,0]
 => [2,5,4,3,1] => [[.,[[[.,.],.],.]],.]
 => [2,3,4,1,5] => 4
Description
The length of the longest increasing subsequence of the permutation.
Matching statistic: St000166
(load all 2 compositions to match this statistic)
Mapping
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00015: Binary trees —to ordered tree: right child = right brother⟶ Ordered trees
St000166: Ordered trees ⟶ ℤ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,2] => [.,[.,.]]
 => [[],[]]
 => 1
[1,1,0,0]
 => [2,1] => [[.,.],.]
 => [[[]]]
 => 2
[1,0,1,0,1,0]
 => [1,2,3] => [.,[.,[.,.]]]
 => [[],[],[]]
 => 1
[1,0,1,1,0,0]
 => [1,3,2] => [.,[[.,.],.]]
 => [[],[[]]]
 => 2
[1,1,0,0,1,0]
 => [2,1,3] => [[.,.],[.,.]]
 => [[[]],[]]
 => 2
[1,1,0,1,0,0]
 => [2,3,1] => [[.,[.,.]],.]
 => [[[],[]]]
 => 2
[1,1,1,0,0,0]
 => [3,2,1] => [[[.,.],.],.]
 => [[[[]]]]
 => 3
[1,0,1,0,1,0,1,0]
 => [1,2,3,4] => [.,[.,[.,[.,.]]]]
 => [[],[],[],[]]
 => 1
[1,0,1,0,1,1,0,0]
 => [1,2,4,3] => [.,[.,[[.,.],.]]]
 => [[],[],[[]]]
 => 2
[1,0,1,1,0,0,1,0]
 => [1,3,2,4] => [.,[[.,.],[.,.]]]
 => [[],[[]],[]]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,3,4,2] => [.,[[.,[.,.]],.]]
 => [[],[[],[]]]
 => 2
[1,0,1,1,1,0,0,0]
 => [1,4,3,2] => [.,[[[.,.],.],.]]
 => [[],[[[]]]]
 => 3
[1,1,0,0,1,0,1,0]
 => [2,1,3,4] => [[.,.],[.,[.,.]]]
 => [[[]],[],[]]
 => 2
[1,1,0,0,1,1,0,0]
 => [2,1,4,3] => [[.,.],[[.,.],.]]
 => [[[]],[[]]]
 => 2
[1,1,0,1,0,0,1,0]
 => [2,3,1,4] => [[.,[.,.]],[.,.]]
 => [[[],[]],[]]
 => 2
[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] => [[.,[[.,.],.]],.]
 => [[[],[[]]]]
 => 3
[1,1,1,0,0,0,1,0]
 => [3,2,1,4] => [[[.,.],.],[.,.]]
 => [[[[]]],[]]
 => 3
[1,1,1,0,0,1,0,0]
 => [3,2,4,1] => [[[.,.],[.,.]],.]
 => [[[[]],[]]]
 => 3
[1,1,1,0,1,0,0,0]
 => [4,2,3,1] => [[[.,.],[.,.]],.]
 => [[[[]],[]]]
 => 3
[1,1,1,1,0,0,0,0]
 => [4,3,2,1] => [[[[.,.],.],.],.]
 => [[[[[]]]]]
 => 4
[1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
 => [[],[],[],[],[]]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
 => [[],[],[],[[]]]
 => 2
[1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
 => [[],[],[[]],[]]
 => 2
[1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
 => [[],[],[[],[]]]
 => 2
[1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
 => [[],[],[[[]]]]
 => 3
[1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
 => [[],[[]],[],[]]
 => 2
[1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
 => [[],[[]],[[]]]
 => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
 => [[],[[],[]],[]]
 => 2
[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] => [.,[[.,[[.,.],.]],.]]
 => [[],[[],[[]]]]
 => 3
[1,0,1,1,1,0,0,0,1,0]
 => [1,4,3,2,5] => [.,[[[.,.],.],[.,.]]]
 => [[],[[[]]],[]]
 => 3
[1,0,1,1,1,0,0,1,0,0]
 => [1,4,3,5,2] => [.,[[[.,.],[.,.]],.]]
 => [[],[[[]],[]]]
 => 3
[1,0,1,1,1,0,1,0,0,0]
 => [1,5,3,4,2] => [.,[[[.,.],[.,.]],.]]
 => [[],[[[]],[]]]
 => 3
[1,0,1,1,1,1,0,0,0,0]
 => [1,5,4,3,2] => [.,[[[[.,.],.],.],.]]
 => [[],[[[[]]]]]
 => 4
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
 => [[[]],[],[],[]]
 => 2
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
 => [[[]],[],[[]]]
 => 2
[1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
 => [[[]],[[]],[]]
 => 2
[1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
 => [[[]],[[],[]]]
 => 2
[1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,4,3] => [[.,.],[[[.,.],.],.]]
 => [[[]],[[[]]]]
 => 3
[1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
 => [[[],[]],[],[]]
 => 2
[1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
 => [[[],[]],[[]]]
 => 2
[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] => [[.,[.,[.,[.,.]]]],.]
 => [[[],[],[],[]]]
 => 2
[1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,4,1] => [[.,[.,[[.,.],.]]],.]
 => [[[],[],[[]]]]
 => 3
[1,1,0,1,1,0,0,0,1,0]
 => [2,4,3,1,5] => [[.,[[.,.],.]],[.,.]]
 => [[[],[[]]],[]]
 => 3
[1,1,0,1,1,0,0,1,0,0]
 => [2,4,3,5,1] => [[.,[[.,.],[.,.]]],.]
 => [[[],[[]],[]]]
 => 3
[1,1,0,1,1,0,1,0,0,0]
 => [2,5,3,4,1] => [[.,[[.,.],[.,.]]],.]
 => [[[],[[]],[]]]
 => 3
[1,1,0,1,1,1,0,0,0,0]
 => [2,5,4,3,1] => [[.,[[[.,.],.],.]],.]
 => [[[],[[[]]]]]
 => 4
Description
The depth minus 1 of an ordered tree. The ordered trees of size $n$ are bijection with the Dyck paths of size $n-1$, and this statistic then corresponds to [[St000013]].
Matching statistic: St001390
(load all 4 compositions to match this statistic)
Mapping
Mp00137: Dyck paths —to symmetric ASM⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00149: Permutations —Lehmer code rotation⟶ Permutations
St001390: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [[1]]
 => [1] => [1] => 1
[1,0,1,0]
 => [[1,0],[0,1]]
 => [1,2] => [2,1] => 2
[1,1,0,0]
 => [[0,1],[1,0]]
 => [2,1] => [1,2] => 1
[1,0,1,0,1,0]
 => [[1,0,0],[0,1,0],[0,0,1]]
 => [1,2,3] => [2,3,1] => 2
[1,0,1,1,0,0]
 => [[1,0,0],[0,0,1],[0,1,0]]
 => [1,3,2] => [2,1,3] => 2
[1,1,0,0,1,0]
 => [[0,1,0],[1,0,0],[0,0,1]]
 => [2,1,3] => [3,2,1] => 3
[1,1,0,1,0,0]
 => [[0,1,0],[1,-1,1],[0,1,0]]
 => [1,3,2] => [2,1,3] => 2
[1,1,1,0,0,0]
 => [[0,0,1],[0,1,0],[1,0,0]]
 => [3,2,1] => [1,2,3] => 1
[1,0,1,0,1,0,1,0]
 => [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
 => [1,2,3,4] => [2,3,4,1] => 2
[1,0,1,0,1,1,0,0]
 => [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
 => [1,2,4,3] => [2,3,1,4] => 2
[1,0,1,1,0,0,1,0]
 => [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
 => [1,3,2,4] => [2,4,3,1] => 3
[1,0,1,1,0,1,0,0]
 => [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
 => [1,2,4,3] => [2,3,1,4] => 2
[1,0,1,1,1,0,0,0]
 => [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
 => [1,4,3,2] => [2,1,3,4] => 2
[1,1,0,0,1,0,1,0]
 => [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
 => [2,1,3,4] => [3,2,4,1] => 3
[1,1,0,0,1,1,0,0]
 => [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
 => [2,1,4,3] => [3,2,1,4] => 3
[1,1,0,1,0,0,1,0]
 => [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
 => [1,3,2,4] => [2,4,3,1] => 3
[1,1,0,1,0,1,0,0]
 => [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
 => [1,2,4,3] => [2,3,1,4] => 2
[1,1,0,1,1,0,0,0]
 => [[0,1,0,0],[1,-1,0,1],[0,0,1,0],[0,1,0,0]]
 => [1,4,3,2] => [2,1,3,4] => 2
[1,1,1,0,0,0,1,0]
 => [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]]
 => [3,2,1,4] => [4,3,2,1] => 4
[1,1,1,0,0,1,0,0]
 => [[0,0,1,0],[0,1,0,0],[1,0,-1,1],[0,0,1,0]]
 => [2,1,4,3] => [3,2,1,4] => 3
[1,1,1,0,1,0,0,0]
 => [[0,0,1,0],[0,1,-1,1],[1,-1,1,0],[0,1,0,0]]
 => [1,4,3,2] => [2,1,3,4] => 2
[1,1,1,1,0,0,0,0]
 => [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]
 => [4,3,2,1] => [1,2,3,4] => 1
[1,0,1,0,1,0,1,0,1,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [1,2,3,4,5] => [2,3,4,5,1] => 2
[1,0,1,0,1,0,1,1,0,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => [2,3,4,1,5] => 2
[1,0,1,0,1,1,0,0,1,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,2,4,3,5] => [2,3,5,4,1] => 3
[1,0,1,0,1,1,0,1,0,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => [2,3,4,1,5] => 2
[1,0,1,0,1,1,1,0,0,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
 => [1,2,5,4,3] => [2,3,1,4,5] => 2
[1,0,1,1,0,0,1,0,1,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [1,3,2,4,5] => [2,4,3,5,1] => 3
[1,0,1,1,0,0,1,1,0,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => [2,4,3,1,5] => 3
[1,0,1,1,0,1,0,0,1,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,2,4,3,5] => [2,3,5,4,1] => 3
[1,0,1,1,0,1,0,1,0,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => [2,3,4,1,5] => 2
[1,0,1,1,0,1,1,0,0,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,0,1,0],[0,0,1,0,0]]
 => [1,2,5,4,3] => [2,3,1,4,5] => 2
[1,0,1,1,1,0,0,0,1,0]
 => [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
 => [1,4,3,2,5] => [2,5,4,3,1] => 4
[1,0,1,1,1,0,0,1,0,0]
 => [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => [2,4,3,1,5] => 3
[1,0,1,1,1,0,1,0,0,0]
 => [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
 => [1,2,5,4,3] => [2,3,1,4,5] => 2
[1,0,1,1,1,1,0,0,0,0]
 => [[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
 => [1,5,4,3,2] => [2,1,3,4,5] => 2
[1,1,0,0,1,0,1,0,1,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [2,1,3,4,5] => [3,2,4,5,1] => 3
[1,1,0,0,1,0,1,1,0,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [2,1,3,5,4] => [3,2,4,1,5] => 3
[1,1,0,0,1,1,0,0,1,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [2,1,4,3,5] => [3,2,5,4,1] => 3
[1,1,0,0,1,1,0,1,0,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [2,1,3,5,4] => [3,2,4,1,5] => 3
[1,1,0,0,1,1,1,0,0,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
 => [2,1,5,4,3] => [3,2,1,4,5] => 3
[1,1,0,1,0,0,1,0,1,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [1,3,2,4,5] => [2,4,3,5,1] => 3
[1,1,0,1,0,0,1,1,0,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => [2,4,3,1,5] => 3
[1,1,0,1,0,1,0,0,1,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,2,4,3,5] => [2,3,5,4,1] => 3
[1,1,0,1,0,1,0,1,0,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => [2,3,4,1,5] => 2
[1,1,0,1,0,1,1,0,0,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,0,1,0],[0,0,1,0,0]]
 => [1,2,5,4,3] => [2,3,1,4,5] => 2
[1,1,0,1,1,0,0,0,1,0]
 => [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
 => [1,4,3,2,5] => [2,5,4,3,1] => 4
[1,1,0,1,1,0,0,1,0,0]
 => [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => [2,4,3,1,5] => 3
[1,1,0,1,1,0,1,0,0,0]
 => [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
 => [1,2,5,4,3] => [2,3,1,4,5] => 2
[1,1,0,1,1,1,0,0,0,0]
 => [[0,1,0,0,0],[1,-1,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
 => [1,5,4,3,2] => [2,1,3,4,5] => 2
Description
The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. For a given permutation $\pi$, this is the index of the row containing $\pi^{-1}(1)$ of the recording tableau of $\pi$ (obtained by [[Mp00070]]).
The following 191 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000094The depth of an ordered tree. St000141The maximum drop size of a permutation. St000651The maximal size of a rise in a permutation. St000662The staircase size of the code of a permutation. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St000442The maximal area to the right of an up step of a Dyck path. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St000983The length of the longest alternating subword. St001644The dimension of a graph. St000381The largest part of an integer composition. St000982The length of the longest constant subword. St000877The depth of the binary word interpreted as a path. St000259The diameter of a connected graph. St000144The pyramid weight of the Dyck path. St000393The number of strictly increasing runs in a binary word. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001267The length of the Lyndon factorization of the binary word. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St001330The hat guessing number of a graph. St000260The radius of a connected graph. St000454The largest eigenvalue of a graph if it is integral. St001060The distinguishing index of a graph. St000264The girth of a graph, which is not a tree. St001645The pebbling number of a connected graph. St000996The number of exclusive left-to-right maxima of a permutation. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000643The size of the largest orbit of antichains under Panyushev complementation. St000306The bounce count of a Dyck path. St000374The number of exclusive right-to-left minima of a permutation. St001235The global dimension of the corresponding Comp-Nakayama algebra. St000392The length of the longest run of ones in a binary word. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000808The number of up steps of the associated bargraph. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001875The number of simple modules with projective dimension at most 1. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000035The number of left outer peaks of a permutation. St000153The number of adjacent cycles of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000245The number of ascents of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000834The number of right outer peaks of a permutation. St000871The number of very big ascents of a permutation. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St000702The number of weak deficiencies of a permutation. St000455The second largest eigenvalue of a graph if it is integral. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000528The height of a poset. St000907The number of maximal antichains of minimal length in a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St000080The rank of the poset. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St001782The order of rowmotion on the set of order ideals of a poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St000474Dyson's crank of a partition. St000993The multiplicity of the largest part of an integer partition. St001175The size of a partition minus the hook length of the base cell. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001280The number of parts of an integer partition that are at least two. St001498The normalised height of a Nakayama algebra with magnitude 1. St001571The Cartan determinant of the integer partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001933The largest multiplicity of a part in an integer partition. St001432The order dimension of the partition. St001488The number of corners of a skew partition. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000460The hook length of the last cell along the main diagonal of an integer partition. St000477The weight of a partition according to Alladi. St000667The greatest common divisor of the parts of the partition. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St001279The sum of the parts of an integer partition that are at least two. St001360The number of covering relations in Young's lattice below a partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001389The number of partitions of the same length below the given integer partition. St001527The cyclic permutation representation number of an integer partition. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001717The largest size of an interval in a poset. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001863The number of weak excedances of a signed permutation. St001889The size of the connectivity set of a signed permutation. St001769The reflection length of a signed permutation. St001861The number of Bruhat lower covers of a permutation. St001864The number of excedances of a signed permutation. St001894The depth of a signed permutation. St001596The number of two-by-two squares inside a skew partition. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001896The number of right descents of a signed permutations. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000703The number of deficiencies of a permutation. St000352The Elizalde-Pak rank of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St000075The orbit size of a standard tableau under promotion. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001720The minimal length of a chain of small intervals in a lattice. St000390The number of runs of ones in a binary word. St000291The number of descents of a binary word. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000097The order of the largest clique of the graph. St001870The number of positive entries followed by a negative entry in a signed permutation. St001893The flag descent of a signed permutation. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001462The number of factors of a standard tableaux under concatenation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001589The nesting number of a perfect matching. St001712The number of natural descents of a standard Young tableau. St001960The number of descents of a permutation minus one if its first entry is not one. St000015The number of peaks of a Dyck path. St000317The cycle descent number of a permutation. St000619The number of cyclic descents of a permutation. St000628The balance of a binary word. St000670The reversal length of a permutation. St000710The number of big deficiencies of a permutation. St000765The number of weak records in an integer composition. St000942The number of critical left to right maxima of the parking functions. St000991The number of right-to-left minima of a permutation. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St000646The number of big ascents of a permutation. St000779The tier of a permutation. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001590The crossing number of a perfect matching. 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. St001811The Castelnuovo-Mumford regularity of a permutation. St001821The sorting index of a signed permutation. St001905The number of preferred parking spots in a parking function less than the index of the car. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001372The length of a longest cyclic run of ones of a binary word. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001624The breadth of a lattice. St000386The number of factors DDU in a Dyck path. St000884The number of isolated descents of a permutation. St000891The number of distinct diagonal sums of a permutation matrix. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001435The number of missing boxes in the first row. St001820The size of the image of the pop stack sorting operator. St001877Number of indecomposable injective modules with projective dimension 2. St000292The number of ascents of a binary word. St000022The number of fixed points of a permutation. St000731The number of double exceedences of a permutation.