searching the database
Your data matches 83 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000157
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00226: Standard tableaux —row-to-column-descents⟶ Standard tableaux
St000157: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00226: Standard tableaux —row-to-column-descents⟶ Standard tableaux
St000157: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1],[2]]
=> [[1],[2]]
=> 1
[1,0,1,0]
=> [[1,3],[2,4]]
=> [[1,2],[3,4]]
=> 1
[1,1,0,0]
=> [[1,2],[3,4]]
=> [[1,3],[2,4]]
=> 2
[1,0,1,0,1,0]
=> [[1,3,5],[2,4,6]]
=> [[1,2,4],[3,5,6]]
=> 2
[1,0,1,1,0,0]
=> [[1,3,4],[2,5,6]]
=> [[1,2,5],[3,4,6]]
=> 2
[1,1,0,0,1,0]
=> [[1,2,5],[3,4,6]]
=> [[1,3,4],[2,5,6]]
=> 2
[1,1,0,1,0,0]
=> [[1,2,4],[3,5,6]]
=> [[1,2,3],[4,5,6]]
=> 1
[1,1,1,0,0,0]
=> [[1,2,3],[4,5,6]]
=> [[1,3,5],[2,4,6]]
=> 3
[1,0,1,0,1,0,1,0]
=> [[1,3,5,7],[2,4,6,8]]
=> [[1,2,4,6],[3,5,7,8]]
=> 3
[1,0,1,0,1,1,0,0]
=> [[1,3,5,6],[2,4,7,8]]
=> [[1,2,4,7],[3,5,6,8]]
=> 3
[1,0,1,1,0,0,1,0]
=> [[1,3,4,7],[2,5,6,8]]
=> [[1,2,5,6],[3,4,7,8]]
=> 2
[1,0,1,1,0,1,0,0]
=> [[1,3,4,6],[2,5,7,8]]
=> [[1,2,4,5],[3,6,7,8]]
=> 2
[1,0,1,1,1,0,0,0]
=> [[1,3,4,5],[2,6,7,8]]
=> [[1,2,5,7],[3,4,6,8]]
=> 3
[1,1,0,0,1,0,1,0]
=> [[1,2,5,7],[3,4,6,8]]
=> [[1,3,4,6],[2,5,7,8]]
=> 3
[1,1,0,0,1,1,0,0]
=> [[1,2,5,6],[3,4,7,8]]
=> [[1,3,4,7],[2,5,6,8]]
=> 3
[1,1,0,1,0,0,1,0]
=> [[1,2,4,7],[3,5,6,8]]
=> [[1,2,3,6],[4,5,7,8]]
=> 2
[1,1,0,1,0,1,0,0]
=> [[1,2,4,6],[3,5,7,8]]
=> [[1,2,3,5],[4,6,7,8]]
=> 2
[1,1,0,1,1,0,0,0]
=> [[1,2,4,5],[3,6,7,8]]
=> [[1,2,3,7],[4,5,6,8]]
=> 2
[1,1,1,0,0,0,1,0]
=> [[1,2,3,7],[4,5,6,8]]
=> [[1,3,5,6],[2,4,7,8]]
=> 3
[1,1,1,0,0,1,0,0]
=> [[1,2,3,6],[4,5,7,8]]
=> [[1,3,4,5],[2,6,7,8]]
=> 2
[1,1,1,0,1,0,0,0]
=> [[1,2,3,5],[4,6,7,8]]
=> [[1,2,3,4],[5,6,7,8]]
=> 1
[1,1,1,1,0,0,0,0]
=> [[1,2,3,4],[5,6,7,8]]
=> [[1,3,5,7],[2,4,6,8]]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [[1,3,5,7,9],[2,4,6,8,10]]
=> [[1,2,4,6,8],[3,5,7,9,10]]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [[1,3,5,7,8],[2,4,6,9,10]]
=> [[1,2,4,6,9],[3,5,7,8,10]]
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [[1,3,5,6,9],[2,4,7,8,10]]
=> [[1,2,4,7,8],[3,5,6,9,10]]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [[1,3,5,6,8],[2,4,7,9,10]]
=> [[1,2,4,6,7],[3,5,8,9,10]]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [[1,3,5,6,7],[2,4,8,9,10]]
=> [[1,2,4,7,9],[3,5,6,8,10]]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [[1,3,4,7,9],[2,5,6,8,10]]
=> [[1,2,5,6,8],[3,4,7,9,10]]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [[1,3,4,7,8],[2,5,6,9,10]]
=> [[1,2,5,6,9],[3,4,7,8,10]]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [[1,3,4,6,9],[2,5,7,8,10]]
=> [[1,2,4,5,8],[3,6,7,9,10]]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [[1,3,4,6,8],[2,5,7,9,10]]
=> [[1,2,4,5,7],[3,6,8,9,10]]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [[1,3,4,6,7],[2,5,8,9,10]]
=> [[1,2,4,5,9],[3,6,7,8,10]]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [[1,3,4,5,9],[2,6,7,8,10]]
=> [[1,2,5,7,8],[3,4,6,9,10]]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [[1,3,4,5,8],[2,6,7,9,10]]
=> [[1,2,5,6,7],[3,4,8,9,10]]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [[1,3,4,5,7],[2,6,8,9,10]]
=> [[1,2,4,5,6],[3,7,8,9,10]]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [[1,3,4,5,6],[2,7,8,9,10]]
=> [[1,2,5,7,9],[3,4,6,8,10]]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [[1,2,5,7,9],[3,4,6,8,10]]
=> [[1,3,4,6,8],[2,5,7,9,10]]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [[1,2,5,7,8],[3,4,6,9,10]]
=> [[1,3,4,6,9],[2,5,7,8,10]]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [[1,2,5,6,9],[3,4,7,8,10]]
=> [[1,3,4,7,8],[2,5,6,9,10]]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [[1,2,5,6,8],[3,4,7,9,10]]
=> [[1,3,4,6,7],[2,5,8,9,10]]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [[1,2,5,6,7],[3,4,8,9,10]]
=> [[1,3,4,7,9],[2,5,6,8,10]]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [[1,2,4,7,9],[3,5,6,8,10]]
=> [[1,2,3,6,8],[4,5,7,9,10]]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [[1,2,4,7,8],[3,5,6,9,10]]
=> [[1,2,3,6,9],[4,5,7,8,10]]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [[1,2,4,6,9],[3,5,7,8,10]]
=> [[1,2,3,5,8],[4,6,7,9,10]]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [[1,2,4,6,8],[3,5,7,9,10]]
=> [[1,2,3,5,7],[4,6,8,9,10]]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [[1,2,4,6,7],[3,5,8,9,10]]
=> [[1,2,3,5,9],[4,6,7,8,10]]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [[1,2,4,5,9],[3,6,7,8,10]]
=> [[1,2,3,7,8],[4,5,6,9,10]]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [[1,2,4,5,8],[3,6,7,9,10]]
=> [[1,2,3,6,7],[4,5,8,9,10]]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [[1,2,4,5,7],[3,6,8,9,10]]
=> [[1,2,3,5,6],[4,7,8,9,10]]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [[1,2,4,5,6],[3,7,8,9,10]]
=> [[1,2,3,7,9],[4,5,6,8,10]]
=> 3
Description
The number of descents of a standard tableau.
Entry $i$ of a standard Young tableau is a descent if $i+1$ appears in a row below the row of $i$.
Matching statistic: St000010
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00086: Permutations —first fundamental transformation⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00086: Permutations —first fundamental transformation⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
St000010: Integer partitions ⟶ ℤ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]
=> [2,1] => [2,1] => [2]
=> 1
[1,1,0,0]
=> [1,2] => [1,2] => [1,1]
=> 2
[1,0,1,0,1,0]
=> [2,3,1] => [3,2,1] => [2,1]
=> 2
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => [2,1]
=> 2
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => [2,1]
=> 2
[1,1,0,1,0,0]
=> [3,1,2] => [2,3,1] => [3]
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => [1,1,1]
=> 3
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,2,3,1] => [2,1,1]
=> 3
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,2,1,4] => [2,1,1]
=> 3
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => [2,2]
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [3,2,4,1] => [3,1]
=> 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => [2,1,1]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,3,2] => [2,1,1]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => [2,1,1]
=> 3
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [3,4,1,2] => [2,2]
=> 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [2,4,3,1] => [3,1]
=> 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [2,3,1,4] => [3,1]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => [2,1,1]
=> 3
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,3,4,2] => [3,1]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [2,3,4,1] => [4]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => [1,1,1,1]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => [2,1,1,1]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => [2,1,1,1]
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => [2,2,1]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [4,2,3,5,1] => [3,1,1]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => [2,1,1,1]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => [2,2,1]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [2,2,1]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [4,2,5,1,3] => [2,2,1]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [3,2,5,4,1] => [3,1,1]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [3,2,4,1,5] => [3,1,1]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [2,2,1]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,4,5,3] => [3,2]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [3,2,4,5,1] => [4,1]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [2,1,1,1]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => [2,1,1,1]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => [2,1,1,1]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [2,2,1]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,4,3,5,2] => [3,1,1]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [2,1,1,1]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [3,5,1,4,2] => [2,2,1]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [3,4,1,2,5] => [2,2,1]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [4,5,3,1,2] => [2,2,1]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [2,5,3,4,1] => [3,1,1]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [2,4,3,1,5] => [3,1,1]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [2,3,1,5,4] => [3,2]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [3,4,1,5,2] => [3,2]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [2,4,3,5,1] => [4,1]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [2,3,1,4,5] => [3,1,1]
=> 3
Description
The length of the partition.
Matching statistic: St000164
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00146: Dyck paths —to tunnel matching⟶ Perfect matchings
St000164: Perfect matchings ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00146: Dyck paths —to tunnel matching⟶ Perfect matchings
St000164: Perfect matchings ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> [(1,2)]
=> 1
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> [(1,4),(2,3)]
=> 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> [(1,2),(3,4)]
=> 2
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 2
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> [(1,4),(2,3),(5,6)]
=> 2
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> [(1,2),(3,6),(4,5)]
=> 2
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> 3
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> 3
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [(1,6),(2,3),(4,5),(7,8)]
=> 3
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [(1,4),(2,3),(5,8),(6,7)]
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [(1,8),(2,3),(4,7),(5,6)]
=> 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [(1,4),(2,3),(5,6),(7,8)]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [(1,2),(3,6),(4,5),(7,8)]
=> 3
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7)]
=> 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [(1,8),(2,7),(3,4),(5,6)]
=> 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [(1,6),(2,5),(3,4),(7,8)]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,8),(6,7)]
=> 3
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [(1,2),(3,8),(4,7),(5,6)]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [(1,8),(2,7),(3,6),(4,5)]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> [(1,10),(2,3),(4,5),(6,7),(8,9)]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> [(1,8),(2,3),(4,5),(6,7),(9,10)]
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> [(1,6),(2,3),(4,5),(7,10),(8,9)]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> [(1,10),(2,3),(4,5),(6,9),(7,8)]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> [(1,6),(2,3),(4,5),(7,8),(9,10)]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> [(1,4),(2,3),(5,10),(6,7),(8,9)]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [(1,4),(2,3),(5,8),(6,7),(9,10)]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> [(1,10),(2,3),(4,7),(5,6),(8,9)]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> [(1,10),(2,3),(4,9),(5,6),(7,8)]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> [(1,8),(2,3),(4,7),(5,6),(9,10)]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> [(1,4),(2,3),(5,6),(7,10),(8,9)]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> [(1,4),(2,3),(5,10),(6,9),(7,8)]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> [(1,10),(2,3),(4,9),(5,8),(6,7)]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> [(1,4),(2,3),(5,6),(7,8),(9,10)]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,10),(4,5),(6,7),(8,9)]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [(1,2),(3,8),(4,5),(6,7),(9,10)]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [(1,2),(3,6),(4,5),(7,10),(8,9)]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [(1,2),(3,10),(4,5),(6,9),(7,8)]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [(1,2),(3,6),(4,5),(7,8),(9,10)]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> [(1,10),(2,5),(3,4),(6,7),(8,9)]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> [(1,8),(2,5),(3,4),(6,7),(9,10)]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> [(1,10),(2,7),(3,4),(5,6),(8,9)]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> [(1,10),(2,9),(3,4),(5,6),(7,8)]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> [(1,8),(2,7),(3,4),(5,6),(9,10)]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> [(1,6),(2,5),(3,4),(7,10),(8,9)]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> [(1,10),(2,5),(3,4),(6,9),(7,8)]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> [(1,10),(2,9),(3,4),(5,8),(6,7)]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> [(1,6),(2,5),(3,4),(7,8),(9,10)]
=> 3
Description
The number of short pairs.
A short pair is a matching pair of the form $(i,i+1)$.
Matching statistic: St000167
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00026: Dyck paths —to ordered tree⟶ Ordered trees
St000167: Ordered trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00026: Dyck paths —to ordered tree⟶ Ordered trees
St000167: Ordered trees ⟶ ℤ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]
=> [2,1] => [1,1,0,0]
=> [[[]]]
=> 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> [[],[]]
=> 2
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> [[[],[]]]
=> 2
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> [[[]],[]]
=> 2
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> [[],[[]]]
=> 2
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> [[[[]]]]
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> [[],[],[]]
=> 3
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [[[],[],[]]]
=> 3
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [[[],[]],[]]
=> 3
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [[[]],[[]]]
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [[[],[[]]]]
=> 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [[[]],[],[]]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [[],[[],[]]]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [[],[[]],[]]
=> 3
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [[[[]],[]]]
=> 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [[[[],[]]]]
=> 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [[[[]]],[]]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [[],[],[[]]]
=> 3
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [[],[[[]]]]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [[[[[]]]]]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [[],[],[],[]]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> [[[],[],[],[]]]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> [[[],[],[]],[]]
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> [[[],[]],[[]]]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> [[[],[],[[]]]]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> [[[],[]],[],[]]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> [[[]],[[],[]]]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [[[]],[[]],[]]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> [[[],[[]],[]]]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> [[[],[[],[]]]]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> [[[],[[]]],[]]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> [[[]],[],[[]]]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> [[[]],[[[]]]]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> [[[],[[[]]]]]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> [[[]],[],[],[]]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [[],[[],[],[]]]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [[],[[],[]],[]]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [[],[[]],[[]]]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [[],[[],[[]]]]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [[],[[]],[],[]]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> [[[[]],[],[]]]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> [[[[]],[]],[]]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> [[[[],[]],[]]]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> [[[[],[],[]]]]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> [[[[],[]]],[]]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> [[[[]]],[[]]]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> [[[[]],[[]]]]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> [[[[],[[]]]]]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> [[[[]]],[],[]]
=> 3
Description
The number of leaves of an ordered tree.
This is the number of nodes which do not have any children.
Matching statistic: St000291
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00093: Dyck paths —to binary word⟶ Binary words
St000291: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00093: Dyck paths —to binary word⟶ Binary words
St000291: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 10 => 1
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> 1100 => 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> 1010 => 2
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> 110100 => 2
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> 110010 => 2
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> 101100 => 2
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> 111000 => 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> 101010 => 3
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 11010100 => 3
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 11010010 => 3
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 11001100 => 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 11011000 => 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 11001010 => 3
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 10110100 => 3
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 10110010 => 3
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 11100100 => 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 11101000 => 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 11100010 => 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 10101100 => 3
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 10111000 => 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 11110000 => 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 10101010 => 4
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => 4
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> 1101010010 => 4
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> 1101001100 => 3
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> 1101011000 => 3
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> 1101001010 => 4
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> 1100110100 => 3
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> 1100110010 => 3
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> 1101100100 => 3
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> 1101101000 => 3
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> 1101100010 => 3
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> 1100101100 => 3
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> 1100111000 => 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> 1101110000 => 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> 1100101010 => 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> 1011010100 => 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> 1011010010 => 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 1011001100 => 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> 1011011000 => 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 1011001010 => 4
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> 1110010100 => 3
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> 1110010010 => 3
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> 1110100100 => 3
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> 1110100010 => 3
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 1110001100 => 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> 1110011000 => 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> 1110110000 => 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 1110001010 => 3
Description
The number of descents of a binary word.
Matching statistic: St000318
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000318: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000318: Integer partitions ⟶ ℤ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]
=> [2,1] => [1,1,0,0]
=> []
=> 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> [1]
=> 2
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> [1]
=> 2
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> [2]
=> 2
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> [1,1]
=> 2
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> []
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> [2,1]
=> 3
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [2,1]
=> 3
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [3,1]
=> 3
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [2,2]
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1]
=> 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [3,2]
=> 3
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> 3
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [2]
=> 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1]
=> 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [3]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> 3
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> []
=> 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [3,2,1]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [3,2,1,1]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> 3
Description
The number of addable cells of the Ferrers diagram of an integer partition.
Matching statistic: St000390
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00093: Dyck paths —to binary word⟶ Binary words
St000390: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00093: Dyck paths —to binary word⟶ Binary words
St000390: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 10 => 1
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> 1100 => 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> 1010 => 2
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> 110100 => 2
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> 110010 => 2
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> 101100 => 2
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> 111000 => 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> 101010 => 3
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 11010100 => 3
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 11010010 => 3
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 11001100 => 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 11011000 => 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 11001010 => 3
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 10110100 => 3
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 10110010 => 3
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 11100100 => 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 11101000 => 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 11100010 => 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 10101100 => 3
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 10111000 => 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 11110000 => 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 10101010 => 4
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => 4
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> 1101010010 => 4
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> 1101001100 => 3
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> 1101011000 => 3
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> 1101001010 => 4
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> 1100110100 => 3
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> 1100110010 => 3
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> 1101100100 => 3
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> 1101101000 => 3
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> 1101100010 => 3
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> 1100101100 => 3
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> 1100111000 => 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> 1101110000 => 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> 1100101010 => 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> 1011010100 => 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> 1011010010 => 4
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 1011001100 => 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> 1011011000 => 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 1011001010 => 4
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> 1110010100 => 3
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> 1110010010 => 3
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> 1110100100 => 3
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> 1110100010 => 3
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 1110001100 => 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> 1110011000 => 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> 1110110000 => 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 1110001010 => 3
Description
The number of runs of ones in a binary word.
Matching statistic: St000245
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000245: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000245: 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 - 1
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> [2,1] => 0 = 1 - 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> [1,2] => 1 = 2 - 1
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> [2,3,1] => 1 = 2 - 1
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> [2,1,3] => 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> [1,3,2] => 1 = 2 - 1
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> [3,2,1] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> [1,2,3] => 2 = 3 - 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 2 = 3 - 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 3 = 4 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 3 = 4 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> [4,2,3,5,1] => 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> [5,2,3,4,1] => 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> [5,2,4,3,1] => 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 2 = 3 - 1
Description
The number of ascents of a permutation.
Matching statistic: St000292
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00093: Dyck paths —to binary word⟶ Binary words
St000292: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00093: Dyck paths —to binary word⟶ Binary words
St000292: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 10 => 0 = 1 - 1
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> 1100 => 0 = 1 - 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> 1010 => 1 = 2 - 1
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> 110100 => 1 = 2 - 1
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> 110010 => 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> 101100 => 1 = 2 - 1
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> 111000 => 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> 101010 => 2 = 3 - 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 11010100 => 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 11010010 => 2 = 3 - 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 11001100 => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 11011000 => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 11001010 => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 10110100 => 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 10110010 => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 11100100 => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 11101000 => 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 11100010 => 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 10101100 => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 10111000 => 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 11110000 => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 10101010 => 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> 1101010010 => 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> 1101001100 => 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> 1101011000 => 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> 1101001010 => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> 1100110100 => 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> 1100110010 => 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> 1101100100 => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> 1101101000 => 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> 1101100010 => 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> 1100101100 => 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> 1100111000 => 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> 1101110000 => 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> 1100101010 => 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> 1011010100 => 3 = 4 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> 1011010010 => 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 1011001100 => 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> 1011011000 => 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 1011001010 => 3 = 4 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> 1110010100 => 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> 1110010010 => 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> 1110100100 => 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> 1110101000 => 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> 1110100010 => 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 1110001100 => 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> 1110011000 => 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> 1110110000 => 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 1110001010 => 2 = 3 - 1
Description
The number of ascents of a binary word.
Matching statistic: St000672
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000672: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000672: 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 - 1
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> [2,1] => 0 = 1 - 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> [1,2] => 1 = 2 - 1
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> [2,3,1] => 1 = 2 - 1
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> [2,1,3] => 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> [1,3,2] => 1 = 2 - 1
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> [3,2,1] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> [1,2,3] => 2 = 3 - 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 2 = 3 - 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 2 = 3 - 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 3 = 4 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 2 = 3 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 3 = 4 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 3 = 4 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 2 = 3 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 3 = 4 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> [4,2,3,5,1] => 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> [5,2,3,4,1] => 2 = 3 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => 2 = 3 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> [5,2,4,3,1] => 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 2 = 3 - 1
Description
The number of minimal elements in Bruhat order not less than the permutation.
The minimal elements in question are biGrassmannian, that is
$$1\dots r\ \ a+1\dots b\ \ r+1\dots a\ \ b+1\dots$$
for some $(r,a,b)$.
This is also the size of Fulton's essential set of the reverse permutation, according to [ex.4.7, 2].
The following 73 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000996The number of exclusive left-to-right maxima of a permutation. St000507The number of ascents of a standard tableau. St000011The number of touch points (or returns) of a Dyck path. St000676The number of odd rises of a Dyck path. St000925The number of topologically connected components of a set partition. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St000024The number of double up and double down steps of a Dyck path. St000053The number of valleys of the Dyck path. St000069The number of maximal elements of a poset. St000105The number of blocks in the set partition. St000482The (zero)-forcing number of a graph. St000211The rank of the set partition. St000340The number of non-final maximal constant sub-paths of length greater than one. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000159The number of distinct parts of the integer partition. St000374The number of exclusive right-to-left minima of a permutation. St000703The number of deficiencies of a permutation. St000052The number of valleys of a Dyck path not on the x-axis. St000031The number of cycles in the cycle decomposition of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000068The number of minimal elements in a poset. St000702The number of weak deficiencies of a permutation. St000007The number of saliances of the permutation. St000470The number of runs in a permutation. St001489The maximum of the number of descents and the number of inverse descents. St000308The height of the tree associated to a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St000354The number of recoils of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000546The number of global descents of a permutation. St001180Number of indecomposable injective modules with projective dimension at most 1. St000213The number of weak exceedances (also weak excedences) of a permutation. St000314The number of left-to-right-maxima of a permutation. St000015The number of peaks of a Dyck path. St000443The number of long tunnels of a Dyck path. St000542The number of left-to-right-minima of a permutation. St000991The number of right-to-left minima of a permutation. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St000062The length of the longest increasing subsequence of the permutation. St000084The number of subtrees. St000239The number of small weak excedances. St000288The number of ones in a binary word. St000325The width of the tree associated to a permutation. St000389The number of runs of ones of odd length in a binary word. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000021The number of descents of a permutation. St000120The number of left tunnels of a Dyck path. St000155The number of exceedances (also excedences) of a permutation. St000168The number of internal nodes of an ordered tree. St000238The number of indices that are not small weak excedances. St000316The number of non-left-to-right-maxima of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000332The positive inversions of an alternating sign matrix. St001083The number of boxed occurrences of 132 in a permutation. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001298The number of repeated entries in the Lehmer code of a permutation. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000061The number of nodes on the left branch of a binary tree. St000083The number of left oriented leafs of a binary tree except the first one. St000898The number of maximal entries in the last diagonal of the monotone triangle. St001820The size of the image of the pop stack sorting operator. St001863The number of weak excedances of a signed permutation. 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)$. St000942The number of critical left to right maxima of the parking functions. St001712The number of natural descents of a standard Young tableau. St001935The number of ascents in a parking function. St000782The indicator function of whether a given perfect matching is an L & P matching.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!