searching the database
Your data matches 245 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: St001165
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
St001165: 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]
=> 2
[1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> 3
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> 2
[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]
=> 2
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> 3
[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]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> 2
Description
Number of simple modules with even projective dimension in the corresponding Nakayama algebra.
Matching statistic: St001471
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
St001471: 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]
=> 2
[1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> 3
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> 2
[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]
=> 2
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> 3
[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]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> 2
Description
The magnitude of a Dyck path.
The magnitude of a finite dimensional algebra with invertible Cartan matrix C is defined as the sum of all entries of the inverse of C.
We define the magnitude of a Dyck path as the magnitude of the corresponding LNakayama algebra.
Matching statistic: St001203
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00199: Dyck paths āprime Dyck pathā¶ Dyck paths
St001203: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
St001203: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 3
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,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,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 2
Description
We 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:
In the list $L$ delete the first entry $c_0$ and substract from all other entries $n-1$ and then append the last element 1 (this was suggested by Christian Stump). The result is a Kupisch series of an LNakayama algebra.
Example:
[5,6,6,6,6] goes into [2,2,2,2,1].
Now associate to the CNakayama algebra with the above properties the Dyck path corresponding to the Kupisch series of the LNakayama algebra.
The statistic return the global dimension of the CNakayama algebra divided by 2.
Matching statistic: St000011
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00199: Dyck paths āprime Dyck pathā¶ Dyck paths
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
St000011: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
St000011: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
Description
The number of touch points (or returns) of a Dyck path.
This is the number of points, excluding the origin, where the Dyck path has height 0.
Matching statistic: St000013
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00199: Dyck paths āprime Dyck pathā¶ Dyck paths
Mp00032: Dyck paths āinverse zeta mapā¶ Dyck paths
St000013: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00032: Dyck paths āinverse zeta mapā¶ Dyck paths
St000013: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0,1,0]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 2
Description
The height of a Dyck path.
The height of a Dyck path $D$ of semilength $n$ is defined as the maximal height of a peak of $D$. The height of $D$ at position $i$ is the number of up-steps minus the number of down-steps before position $i$.
Matching statistic: St001068
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00199: Dyck paths āprime Dyck pathā¶ Dyck paths
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
St001068: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
St001068: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
Description
Number of torsionless simple modules in the corresponding Nakayama algebra.
Matching statistic: St000053
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00199: Dyck paths āprime Dyck pathā¶ Dyck paths
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
St000053: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
St000053: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
Description
The number of valleys of the Dyck path.
Matching statistic: St000442
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00199: Dyck paths āprime Dyck pathā¶ Dyck paths
Mp00032: Dyck paths āinverse zeta mapā¶ Dyck paths
St000442: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00032: Dyck paths āinverse zeta mapā¶ Dyck paths
St000442: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
Description
The maximal area to the right of an up step of a Dyck path.
Matching statistic: St000970
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00199: Dyck paths āprime Dyck pathā¶ Dyck paths
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
St000970: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
St000970: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
Description
Number of peaks minus the dominant dimension of the corresponding LNakayama algebra.
Matching statistic: St001011
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00199: Dyck paths āprime Dyck pathā¶ Dyck paths
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
St001011: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
St001011: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
Description
Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path.
The following 235 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St000025The number of initial rises of a Dyck path. St000105The number of blocks in the set partition. St000167The number of leaves of an ordered tree. St000201The number of leaf nodes in a binary tree. St000444The length of the maximal rise of a Dyck path. St000522The number of 1-protected nodes of a rooted tree. St000568The hook number of a binary tree. St000675The number of centered multitunnels of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000925The number of topologically connected components of a set partition. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001058The breadth of the ordered tree. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001732The number of peaks visible from the left. St001809The index of the step at the first peak of maximal height in a Dyck path. St000012The area of a Dyck path. St000024The number of double up and double down steps of a Dyck path. St000052The number of valleys of a Dyck path not on the x-axis. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000234The number of global ascents of a permutation. St000257The number of distinct parts of a partition that occur at least twice. St000340The number of non-final maximal constant sub-paths of length greater than one. St000386The number of factors DDU in a Dyck path. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000439The position of the first down step of a Dyck path. St000445The number of rises of length 1 of a Dyck path. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000874The position of the last double rise in a Dyck path. St000984The number of boxes below precisely one peak. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001139The number of occurrences of hills of size 2 in a Dyck path. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000306The bounce count of a Dyck path. St000374The number of exclusive right-to-left minima of a permutation. St000670The reversal length of a permutation. St000703The number of deficiencies of a permutation. St000884The number of isolated descents of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St000470The number of runs in a permutation. St000619The number of cyclic descents of a permutation. St000353The number of inner valleys of a permutation. St000354The number of recoils of a permutation. St000494The number of inversions of distance at most 3 of a permutation. St000495The number of inversions of distance at most 2 of a permutation. St000539The number of odd inversions of a permutation. St000795The mad of a permutation. St000809The reduced reflection length of the permutation. St000829The Ulam distance of a permutation to the identity permutation. St000831The number of indices that are either descents or recoils. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000957The number of Bruhat lower covers of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001412Number of minimal entries in the Bruhat order matrix of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001665The number of pure excedances of a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001726The number of visible inversions of a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St001928The number of non-overlapping descents in a permutation. St000527The width of the poset. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St000528The height of a poset. St000159The number of distinct parts of the integer partition. St000481The number of upper covers of a partition in dominance order. St000245The number of ascents of a permutation. St000834The number of right outer peaks of a permutation. St000451The length of the longest pattern of the form k 1 2. St000662The staircase size of the code of a permutation. St000007The number of saliances of the permutation. St000035The number of left outer peaks of a permutation. St000546The number of global descents of a permutation. St000647The number of big descents of a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St000646The number of big ascents of a permutation. St000663The number of right floats of a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St000153The number of adjacent cycles of a permutation. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000018The number of inversions of a permutation. St000019The cardinality of the support of a permutation. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000237The number of small exceedances. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000157The number of descents of a standard tableau. St000164The number of short pairs. St000291The number of descents of a binary word. St000390The number of runs of ones in a binary word. St000843The decomposition number of a perfect matching. St000292The number of ascents of a binary word. St001394The genus of a permutation. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000141The maximum drop size of a permutation. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St000542The number of left-to-right-minima 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. St000779The tier of a permutation. St000015The number of peaks of a Dyck path. 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. St000080The rank of the poset. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001274The number of indecomposable injective modules with projective dimension equal to two. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St000056The decomposition (or block) number of a permutation. St000061The number of nodes on the left branch of a binary tree. St000062The length of the longest increasing subsequence of the permutation. St000084The number of subtrees. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000166The depth minus 1 of an ordered tree. St000213The number of weak exceedances (also weak excedences) of a permutation. St000239The number of small weak excedances. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000443The number of long tunnels of a Dyck path. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000991The number of right-to-left minima of a permutation. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001530The depth of a Dyck path. St000021The number of descents of a permutation. St000023The number of inner peaks of a permutation. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000055The inversion sum of a permutation. St000083The number of left oriented leafs of a binary tree except the first one. St000094The depth of an ordered tree. St000155The number of exceedances (also excedences) of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000216The absolute length of a permutation. St000224The sorting index of a permutation. St000238The number of indices that are not small weak excedances. St000241The number of cyclical small excedances. St000242The number of indices that are not cyclical small weak excedances. St000316The number of non-left-to-right-maxima of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001180Number of indecomposable injective modules with projective dimension at most 1. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001388The number of non-attacking neighbors of a permutation. St001480The number of simple summands of the module J^2/J^3. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001511The minimal number of transpositions needed to sort a permutation in either direction. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001874Lusztig's a-function for the symmetric group. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001371The length of the longest Yamanouchi prefix of a binary word. St001730The number of times the path corresponding to a binary word crosses the base line. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000648The number of 2-excedences of a permutation. St000871The number of very big ascents of a permutation. St001330The hat guessing number of a graph. St001597The Frobenius rank of a skew partition. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000317The cycle descent number of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000702The number of weak deficiencies of a permutation. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001589The nesting number of a perfect matching. St000217The number of occurrences of the pattern 312 in a permutation. St000358The number of occurrences of the pattern 31-2. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000711The number of big exceedences of a permutation. St000732The number of double deficiencies of a permutation. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001727The number of invisible inversions of a permutation. St001905The number of preferred parking spots in a parking function less than the index of the car. St001960The number of descents of a permutation minus one if its first entry is not one. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000862The number of parts of the shifted shape of a permutation. St001624The breadth of a lattice. St000028The number of stack-sorts needed to sort a permutation.
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!