searching the database
Your data matches 199 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: St000329
(load all 35 compositions to match this statistic)
(load all 35 compositions to match this statistic)
St000329: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> 0
[1,0,1,0]
=> 0
[1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> 3
Description
The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1.
Matching statistic: St000053
(load all 90 compositions to match this statistic)
(load all 90 compositions to match this statistic)
Mp00227: Dyck paths āDelest-Viennot-inverseā¶ Dyck paths
St000053: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
St000053: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,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,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,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,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,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
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[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,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[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,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[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,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,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3
Description
The number of valleys of the Dyck path.
Matching statistic: St000155
(load all 36 compositions to match this statistic)
(load all 36 compositions to match this statistic)
Mp00023: Dyck paths āto non-crossing permutationā¶ Permutations
St000155: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
St000155: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 0
[1,0,1,0]
=> [1,2] => 0
[1,1,0,0]
=> [2,1] => 1
[1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => 1
[1,1,0,0,1,0]
=> [2,1,3] => 1
[1,1,0,1,0,0]
=> [2,3,1] => 2
[1,1,1,0,0,0]
=> [3,2,1] => 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 3
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 3
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 3
Description
The number of exceedances (also excedences) of a permutation.
This is defined as $exc(\sigma) = \#\{ i : \sigma(i) > i \}$.
It is known that the number of exceedances is equidistributed with the number of descents, and that the bistatistic $(exc,den)$ is [[Permutations/Descents-Major#Euler-Mahonian_statistics|Euler-Mahonian]]. Here, $den$ is the Denert index of a permutation, see [[St000156]].
Matching statistic: St001169
(load all 90 compositions to match this statistic)
(load all 90 compositions to match this statistic)
Mp00227: Dyck paths āDelest-Viennot-inverseā¶ Dyck paths
St001169: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
St001169: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,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,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,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,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,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
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[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,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[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,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[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,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,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3
Description
Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St000015
(load all 90 compositions to match this statistic)
(load all 90 compositions to match this statistic)
Mp00227: Dyck paths āDelest-Viennot-inverseā¶ Dyck paths
St000015: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
St000015: 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
[1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,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]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3 = 2 + 1
[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,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[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,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[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,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,0,1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 4 = 3 + 1
Description
The number of peaks of a Dyck path.
Matching statistic: St000676
(load all 59 compositions to match this statistic)
(load all 59 compositions to match this statistic)
Mp00228: Dyck paths āreflect parallelogram polyominoā¶ Dyck paths
St000676: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
St000676: 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
[1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[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,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
Description
The number of odd rises of a Dyck path.
This is the number of ones at an odd position, with the initial position equal to 1.
The number of Dyck paths of semilength $n$ with $k$ up steps in odd positions and $k$ returns to the main diagonal are counted by the binomial coefficient $\binom{n-1}{k-1}$ [3,4].
Matching statistic: St001068
(load all 90 compositions to match this statistic)
(load all 90 compositions to match this statistic)
Mp00227: Dyck paths āDelest-Viennot-inverseā¶ Dyck paths
St001068: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
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
[1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,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]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3 = 2 + 1
[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,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[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,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[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,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,0,1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 4 = 3 + 1
Description
Number of torsionless simple modules in the corresponding Nakayama algebra.
Matching statistic: St000021
(load all 52 compositions to match this statistic)
(load all 52 compositions to match this statistic)
Mp00023: Dyck paths āto non-crossing permutationā¶ Permutations
Mp00236: Permutations āClarke-Steingrimsson-Zeng inverseā¶ Permutations
St000021: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00236: Permutations āClarke-Steingrimsson-Zeng inverseā¶ Permutations
St000021: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => 0
[1,1,0,0]
=> [2,1] => [2,1] => 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 1
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => 2
[1,1,1,0,0,0]
=> [3,2,1] => [2,3,1] => 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,3,4,2] => 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,3,2,1] => 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,4,2,1] => 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,3,1,4] => 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [2,4,3,1] => 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,3,4,1] => 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [3,2,4,1] => 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,4,5,3] => 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,4,3,2] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,4,5,3,2] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,3,4,2,5] => 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,3,5,4,2] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,3,4,5,2] => 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,4,3,5,2] => 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,4,5,3] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,3,2,1,5] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,4,3,2,1] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,5,3,2,1] => 3
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,4,2,1,5] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [3,5,4,2,1] => 3
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,4,5,2,1] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [4,3,5,2,1] => 3
Description
The number of descents of a permutation.
This can be described as an occurrence of the vincular mesh pattern ([2,1], {(1,0),(1,1),(1,2)}), i.e., the middle column is shaded, see [3].
Matching statistic: St000024
(load all 87 compositions to match this statistic)
(load all 87 compositions to match this statistic)
Mp00227: Dyck paths āDelest-Viennot-inverseā¶ Dyck paths
Mp00120: Dyck paths āLalanne-Kreweras involutionā¶ Dyck paths
St000024: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00120: Dyck paths āLalanne-Kreweras involutionā¶ Dyck paths
St000024: 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]
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
[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,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 1
[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,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,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,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,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]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,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,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,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,0,0,1,0,1,0]
=> 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]
=> 2
[1,0,1,1,0,1,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,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[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,1,0,0]
=> 2
[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,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 3
[1,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]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
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: St000052
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00227: Dyck paths āDelest-Viennot-inverseā¶ Dyck paths
Mp00199: Dyck paths āprime Dyck pathā¶ Dyck paths
St000052: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00199: Dyck paths āprime Dyck pathā¶ Dyck paths
St000052: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,1,0,0]
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,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,1,1,0,0,0,1,1,0,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,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,1,1,0,0,1,1,1,0,0,0,0]
=> 1
[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,1,0,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 2
[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,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 2
[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,1,0,1,0,0,0]
=> 3
Description
The number of valleys of a Dyck path not on the x-axis.
That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.
The following 189 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000168The number of internal nodes of an ordered tree. St000211The rank of the set partition. St000245The number of ascents of a permutation. St000292The number of ascents of a binary word. St000316The number of non-left-to-right-maxima of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000340The number of non-final maximal constant sub-paths of length greater than one. St000672The number of minimal elements in Bruhat order not less than the permutation. St000703The number of deficiencies of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001153The number of blocks with even minimum in a set partition. St001298The number of repeated entries in the Lehmer code of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001907The number of Bastidas - Hohlweg - Saliola excedances of a signed permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000105The number of blocks in the set partition. St000147The largest part of an integer partition. St000157The number of descents of a standard tableau. St000164The number of short pairs. St000167The number of leaves of an ordered tree. St000213The number of weak exceedances (also weak excedences) of a permutation. St000239The number of small weak excedances. St000291The number of descents of a binary word. St000314The number of left-to-right-maxima of a permutation. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000325The width of the tree associated to a permutation. St000390The number of runs of ones in a binary word. St000443The number of long tunnels of a Dyck path. St000470The number of runs in a permutation. St000542The number of left-to-right-minima of a permutation. St000912The number of maximal antichains in a poset. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the 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. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001461The number of topologically connected components of the chord diagram 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. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St000065The number of entries equal to -1 in an alternating sign matrix. St000080The rank of the poset. St000120The number of left tunnels of a Dyck path. St000141The maximum drop size of a permutation. St000234The number of global ascents of a permutation. St000238The number of indices that are not small weak excedances. St000272The treewidth of a graph. St000306The bounce count of a Dyck path. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000332The positive inversions of an alternating sign matrix. St000362The size of a minimal vertex cover of a graph. St000374The number of exclusive right-to-left minima of a permutation. St000377The dinv defect of an integer partition. St000386The number of factors DDU in a Dyck path. St000536The pathwidth of a graph. St000632The jump number of the poset. St000662The staircase size of the code of a permutation. St000834The number of right outer peaks of a permutation. St000871The number of very big ascents of a permutation. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001083The number of boxed occurrences of 132 in a permutation. St001086The number of occurrences of the consecutive pattern 132 in 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. St001176The size of a partition minus its first part. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001277The degeneracy of a graph. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001358The largest degree of a regular subgraph of a graph. St001427The number of descents of a signed permutation. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001622The number of join-irreducible elements of a lattice. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000007The number of saliances of the permutation. St000010The length of the partition. St000011The number of touch points (or returns) of a Dyck path. St000035The number of left outer peaks of a permutation. St000056The decomposition (or block) number of a permutation. St000068The number of minimal elements in a poset. St000071The number of maximal chains in a poset. St000093The cardinality of a maximal independent set of vertices of a graph. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000146The Andrews-Garvan crank of a partition. St000153The number of adjacent cycles of a permutation. St000172The Grundy number of a graph. St000201The number of leaf nodes in a binary tree. St000237The number of small exceedances. St000288The number of ones in a binary word. St000308The height of the tree associated to a permutation. St000389The number of runs of ones of odd length in a binary word. St000507The number of ascents of a standard tableau. St000527The width of the poset. St000528The height of a poset. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000734The last entry in the first row of a standard tableau. St000742The number of big ascents of a permutation after prepending zero. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000822The Hadwiger number of the graph. St000925The number of topologically connected components of a set partition. St000991The number of right-to-left minima of a permutation. St001029The size of the core of a graph. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{nā1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows:
St001280The number of parts of an integer partition that are at least two. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001389The number of partitions of the same length below the given integer partition. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001616The number of neutral elements in a lattice. St001670The connected partition number of a graph. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001720The minimal length of a chain of small intervals in a lattice. St001963The tree-depth of a graph. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001619The number of non-isomorphic sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St000216The absolute length of a permutation. St000809The reduced reflection length of the permutation. St000083The number of left oriented leafs of a binary tree except the first one. St000354The number of recoils of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000829The Ulam distance of a permutation to the identity permutation. St000702The number of weak deficiencies of a permutation. St000061The number of nodes on the left branch of a binary tree. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001651The Frankl number of a lattice. St001812The biclique partition number of a graph. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000159The number of distinct parts of the integer partition. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001875The number of simple modules with projective dimension at most 1. St000619The number of cyclic descents of a permutation. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000746The number of pairs with odd minimum in a perfect matching. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001152The number of pairs with even minimum in a perfect matching. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001429The number of negative entries in a signed permutation. St000236The number of cyclical small weak excedances. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001668The number of points of the poset minus the width of the poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001782The order of rowmotion on the set of order ideals of a poset. St000906The length of the shortest maximal chain in a poset. St000643The size of the largest orbit of antichains under Panyushev complementation. St001330The hat guessing number of a graph. St001820The size of the image of the pop stack sorting operator. St001637The number of (upper) dissectors of a poset. St001769The reflection length of a signed permutation. St001864The number of excedances of a signed permutation. St001896The number of right descents of a signed permutations. St001863The number of weak excedances of a signed permutation. St000648The number of 2-excedences of a permutation. St001712The number of natural descents of a standard Young tableau. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001905The number of preferred parking spots in a parking function less than the index of the car. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St001960The number of descents of a permutation minus one if its first entry is not one. St000331The number of upper interactions of a Dyck path. St000942The number of critical left to right maxima of the parking functions. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001589The nesting number of a perfect matching. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001877Number of indecomposable injective modules with projective dimension 2.
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!