searching the database
Your data matches 95 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: St000024
(load all 9 compositions to match this statistic)
(load all 9 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
St000024: Dyck paths ⟶ ℤ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
St000024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 0
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> 1
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 1
[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]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 1
[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]
=> 1
[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]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 0
[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
[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
[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
[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
[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
[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,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,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
[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,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
[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,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> 3
[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]
=> 3
[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
[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
[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
[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]
=> 2
[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
[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
[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]
=> 2
[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]
=> 2
[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]
=> 2
[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,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> 2
[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
[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
[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]
=> 3
[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]
=> 2
Description
The number of double up and double down steps of a Dyck path.
In other words, this is the number of double rises (and, equivalently, the number of double falls) of a Dyck path.
Matching statistic: St000157
(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
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000157: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000157: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [[1]]
=> 0
[1,0,1,0]
=> [2,1] => [2,1] => [[1],[2]]
=> 1
[1,1,0,0]
=> [1,2] => [1,2] => [[1,2]]
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => [3,1,2] => [[1,3],[2]]
=> 1
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => [[1,3],[2]]
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => [[1,2],[3]]
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => [3,2,1] => [[1],[2],[3]]
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => [[1,2,3]]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,1,2,3] => [[1,3,4],[2]]
=> 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,1,2,4] => [[1,3,4],[2]]
=> 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => [[1,3],[2,4]]
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [4,3,1,2] => [[1,4],[2],[3]]
=> 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => [[1,3,4],[2]]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,2,3] => [[1,2,4],[3]]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => [[1,2,4],[3]]
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [4,2,1,3] => [[1,4],[2],[3]]
=> 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [3,1,4,2] => [[1,3],[2,4]]
=> 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,2,1,4] => [[1,4],[2],[3]]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => [[1,2,3],[4]]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,3,2] => [[1,2],[3],[4]]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,3,2,1] => [[1],[2],[3],[4]]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => [[1,2,3,4]]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => [[1,3,4,5],[2]]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,1,2,3,5] => [[1,3,4,5],[2]]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,1,2,5,4] => [[1,3,4],[2,5]]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [5,4,1,2,3] => [[1,4,5],[2],[3]]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,1,2,4,5] => [[1,3,4,5],[2]]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,3,4] => [[1,3,5],[2,4]]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [[1,3,5],[2,4]]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [5,3,1,2,4] => [[1,4,5],[2],[3]]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [4,1,2,5,3] => [[1,3,4],[2,5]]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [4,3,1,2,5] => [[1,4,5],[2],[3]]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [[1,3,4],[2,5]]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,5,4,3] => [[1,3],[2,4],[5]]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [5,4,3,1,2] => [[1,5],[2],[3],[4]]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [[1,3,4,5],[2]]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,2,3,4] => [[1,2,4,5],[3]]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,2,3,5] => [[1,2,4,5],[3]]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [[1,2,4],[3,5]]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,5,4,2,3] => [[1,2,5],[3],[4]]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [[1,2,4,5],[3]]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [5,2,1,3,4] => [[1,4,5],[2],[3]]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [4,2,1,3,5] => [[1,4,5],[2],[3]]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [3,1,5,2,4] => [[1,3,5],[2,4]]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [5,2,4,1,3] => [[1,3],[2,5],[4]]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [3,1,4,2,5] => [[1,3,5],[2,4]]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,2,1,5,4] => [[1,4],[2,5],[3]]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [5,4,2,1,3] => [[1,5],[2],[3],[4]]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [3,1,5,4,2] => [[1,3],[2,4],[5]]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,2,1,4,5] => [[1,4,5],[2],[3]]
=> 2
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: St000053
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000053: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000053: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[]
=> []
=> []
=> ? = 0
Description
The number of valleys of the Dyck path.
Matching statistic: St001007
(load all 9 compositions to match this statistic)
(load all 9 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
St001007: Dyck paths ⟶ ℤ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
St001007: Dyck paths ⟶ ℤ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,0,1,0]
=> [2,1] => [1,1,0,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 3 = 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
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 1 = 0 + 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 = 1 + 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 = 1 + 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]
=> 3 = 2 + 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]
=> 3 = 2 + 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 = 1 + 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]
=> 3 = 2 + 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]
=> 3 = 2 + 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]
=> 3 = 2 + 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]
=> 3 = 2 + 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]
=> 3 = 2 + 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]
=> 3 = 2 + 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]
=> 4 = 3 + 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]
=> 4 = 3 + 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 + 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]
=> 2 = 1 + 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]
=> 2 = 1 + 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]
=> 3 = 2 + 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]
=> 3 = 2 + 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]
=> 2 = 1 + 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 + 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 + 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]
=> 3 = 2 + 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]
=> 3 = 2 + 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]
=> 3 = 2 + 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]
=> 4 = 3 + 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]
=> 4 = 3 + 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]
=> 4 = 3 + 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
[]
=> [] => []
=> ? = 0 + 1
Description
Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001068
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001068: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001068: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[]
=> []
=> []
=> ? = 0 + 1
Description
Number of torsionless simple modules in the corresponding Nakayama algebra.
Matching statistic: St000012
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000012: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000012: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [1,0]
=> 0
[1,0,1,0]
=> [2,1] => [[.,.],.]
=> [1,1,0,0]
=> 1
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1
[1,0,1,1,0,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[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,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,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]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[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,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[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,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3
[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
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 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]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[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
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[]
=> [] => .
=> ?
=> ? = 0
Description
The area of a Dyck path.
This is the number of complete squares in the integer lattice which are below the path and above the x-axis. The 'half-squares' directly above the axis do not contribute to this statistic.
1. Dyck paths are bijection with '''area sequences''' $(a_1,\ldots,a_n)$ such that $a_1 = 0, a_{k+1} \leq a_k + 1$.
2. The generating function $\mathbf{D}_n(q) = \sum_{D \in \mathfrak{D}_n} q^{\operatorname{area}(D)}$ satisfy the recurrence $$\mathbf{D}_{n+1}(q) = \sum q^k \mathbf{D}_k(q) \mathbf{D}_{n-k}(q).$$
3. The area is equidistributed with [[St000005]] and [[St000006]]. Pairs of these statistics play an important role in the theory of $q,t$-Catalan numbers.
Matching statistic: St000211
(load all 4 compositions to match this statistic)
(load all 4 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
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000211: Set 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
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000211: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> {{1}}
=> 0
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> {{1,2}}
=> 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> {{1},{2}}
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> {{1,3},{2}}
=> 1
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> {{1,2},{3}}
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> {{1},{2,3}}
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> {{1,2,3}}
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 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}}
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 0
[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,5},{2},{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]
=> {{1,4},{2},{3},{5}}
=> 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]
=> {{1,3},{2},{4,5}}
=> 2
[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,4,5},{2},{3}}
=> 2
[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,3},{2},{4},{5}}
=> 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]
=> {{1,2},{3,5},{4}}
=> 2
[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,2},{3,4},{5}}
=> 2
[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,5},{2},{3,4}}
=> 2
[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,3,5},{2},{4}}
=> 2
[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,3,4},{2},{5}}
=> 2
[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,2},{3},{4,5}}
=> 2
[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,2},{3,4,5}}
=> 3
[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,3,4,5},{2}}
=> 3
[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,2},{3},{4},{5}}
=> 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},{2,5},{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},{2,4},{3},{5}}
=> 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},{2,3},{4,5}}
=> 2
[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,4,5},{3}}
=> 2
[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},{4},{5}}
=> 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]
=> {{1,5},{2,3},{4}}
=> 2
[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,4},{2,3},{5}}
=> 2
[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,5},{2,4},{3}}
=> 2
[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,2,5},{3},{4}}
=> 2
[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,2,4},{3},{5}}
=> 2
[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,2,3},{4,5}}
=> 3
[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,4,5},{2,3}}
=> 3
[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,2,4,5},{3}}
=> 3
[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,2,3},{4},{5}}
=> 2
[]
=> [] => []
=> {}
=> ? = 0
Description
The rank of the set partition.
This is defined as the number of elements in the set partition minus the number of blocks, or, equivalently, the number of arcs in the one-line diagram associated to the set partition.
Matching statistic: St000340
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
St000340: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00122: Dyck paths —Elizalde-Deutsch bijection⟶ Dyck paths
St000340: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[]
=> []
=> []
=> []
=> ? = 0
Description
The number of non-final maximal constant sub-paths of length greater than one.
This is the total number of occurrences of the patterns $110$ and $001$.
Matching statistic: St000394
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [1,0]
=> 0
[1,0,1,0]
=> [2,1] => [[.,.],.]
=> [1,1,0,0]
=> 1
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1
[1,0,1,1,0,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[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,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,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]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[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,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[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,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3
[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
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 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]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[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
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[]
=> [] => .
=> ?
=> ? = 0
Description
The sum of the heights of the peaks of a Dyck path minus the number of peaks.
Matching statistic: St001512
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001512: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001512: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> ([],1)
=> ([],1)
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> ([],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> ([],2)
=> 0
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> ([],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,1),(0,2)],3)
=> ([(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> ([],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2)],4)
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> ([(1,2),(1,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(3,1),(3,2)],4)
=> ([(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> ([(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(3,1)],4)
=> ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(1,2),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(1,2),(1,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 3
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> ([],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(0,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> ([(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ([(0,4),(4,1),(4,2),(4,3)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(2,3)],5)
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> ([(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ([(0,3),(0,4),(4,1),(4,2)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(4,2),(4,3)],5)
=> ([(1,4),(2,3)],5)
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ([(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> ([(1,4),(2,3)],5)
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> ([(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> ([(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> ([(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ([(0,2),(0,3),(0,4),(4,1)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(1,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(3,2),(4,1),(4,3)],5)
=> ([(2,4),(3,4)],5)
=> 2
[]
=> []
=> ?
=> ?
=> ? = 0
Description
The minimum rank of a graph.
The minimum rank of a simple graph G is the smallest possible rank over all symmetric real matrices whose entry in row $i$ and column $j$ (for $i\neq j$) is nonzero whenever $\{i, j\}$ is an edge in
$G$, and zero otherwise.
The following 85 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000105The number of blocks in the set partition. St000288The number of ones in a binary word. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000984The number of boxes below precisely one peak. St000925The number of topologically connected components of a set partition. St000374The number of exclusive right-to-left minima of a permutation. St000703The number of deficiencies of a permutation. St000912The number of maximal antichains in a poset. St000167The number of leaves of an ordered tree. St000996The number of exclusive left-to-right maxima of a permutation. St000159The number of distinct parts of the integer partition. St001489The maximum of the number of descents and the number of inverse descents. St000470The number of runs in a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000245The number of ascents of a permutation. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000702The number of weak deficiencies of a permutation. St000354The number of recoils of a permutation. St000809The reduced reflection length of the permutation. St000161The sum of the sizes of the right subtrees of a binary tree. St000662The staircase size of the code of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000052The number of valleys of a Dyck path not on the x-axis. St000672The number of minimal elements in Bruhat order not less than the permutation. St000246The number of non-inversions of a permutation. St001907The number of Bastidas - Hohlweg - Saliola excedances of a signed permutation. St000292The number of ascents of a binary word. St000332The positive inversions of an alternating sign matrix. St000164The number of short pairs. St000291The number of descents of a binary word. St000390The number of runs of ones in a binary word. St000021The number of descents of a permutation. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001298The number of repeated entries in the Lehmer code of a permutation. St000542The number of left-to-right-minima of a permutation. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St000316The number of non-left-to-right-maxima of a permutation. St000120The number of left tunnels of a Dyck path. St000155The number of exceedances (also excedences) of a permutation. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St000015The number of peaks of a Dyck path. St000325The width of the tree associated to a permutation. St000443The number of long tunnels of a Dyck path. 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. St000168The number of internal nodes of an ordered tree. St000238The number of indices that are not small weak excedances. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St000062The length of the longest increasing subsequence of the permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000239The number of small weak excedances. St000314The number of left-to-right-maxima of a permutation. St000740The last entry of a permutation. St000991The number of right-to-left minima of a permutation. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. 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. St001180Number of indecomposable injective modules with projective dimension at most 1. St000216The absolute length of a permutation. St000083The number of left oriented leafs of a binary tree except the first one. St001480The number of simple summands of the module J^2/J^3. St000727The largest label of a leaf in the binary search tree associated with the permutation. St001346The number of parking functions that give the same permutation. St001427The number of descents of a signed permutation. St000065The number of entries equal to -1 in an alternating sign matrix. St000647The number of big descents of a permutation. St000710The number of big deficiencies of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. 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. St000711The number of big exceedences of a permutation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000358The number of occurrences of the pattern 31-2. St001769The reflection length of a signed permutation. St001864The number of excedances of a signed permutation. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001905The number of preferred parking spots in a parking function less than the index of the car. St001712The number of natural descents of a standard Young tableau. St001946The number of descents in a parking function. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order.
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!