searching the database
Your data matches 921 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: St000053
(load all 364 compositions to match this statistic)
(load all 364 compositions to match this statistic)
St000053: 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]
=> 1
[1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,1,0,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,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 4
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 4
[1,0,1,0,1,0,1,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,0,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,1,0,1,0,0,0]
=> 3
[1,0,1,0,1,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,0,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,0,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,0,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,0,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 4
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> 4
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 4
[1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> 3
[1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> 3
Description
The number of valleys of the Dyck path.
Matching statistic: St001067
(load all 140 compositions to match this statistic)
(load all 140 compositions to match this statistic)
St001067: 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]
=> 1
[1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,1,0,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,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 4
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 4
[1,0,1,0,1,0,1,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,0,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,1,0,1,0,0,0]
=> 3
[1,0,1,0,1,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,0,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,0,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,0,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,0,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 4
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> 4
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 4
[1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> 3
[1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> 3
Description
The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St001197
(load all 128 compositions to match this statistic)
(load all 128 compositions to match this statistic)
St001197: 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]
=> 1
[1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,1,0,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,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 4
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 4
[1,0,1,0,1,0,1,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,0,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,1,0,1,0,0,0]
=> 3
[1,0,1,0,1,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,0,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,0,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,0,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,0,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 4
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> 4
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 4
[1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> 3
[1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> 3
Description
The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$.
Matching statistic: St000684
(load all 50 compositions to match this statistic)
(load all 50 compositions to match this statistic)
St000684: 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,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,0,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 7 = 6 + 1
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> 4 = 3 + 1
Description
The global dimension of the LNakayama algebra associated to a Dyck path.
An n-LNakayama algebra is a quiver algebra with a directed line as a connected quiver with $n$ points for $n \geq 2$. Number those points from the left to the right by $0,1,\ldots,n-1$.
The algebra is then uniquely determined by the dimension $c_i$ of the projective indecomposable modules at point $i$. Such algebras are then uniquely determined by lists of the form $[c_0,c_1,...,c_{n-1}]$ with the conditions: $c_{n-1}=1$ and $c_i -1 \leq c_{i+1}$ for all $i$. The number of such algebras is then the $n-1$-st Catalan number $C_{n-1}$.
One can get also an interpretation with Dyck paths by associating the top boundary of the Auslander-Reiten quiver (which is a Dyck path) to those algebras. Example: [3,4,3,3,2,1] corresponds to the Dyck path [1,1,0,1,1,0,0,1,0,0].
Conjecture: that there is an explicit bijection between $n$-LNakayama algebras with global dimension bounded by $m$ and Dyck paths with height at most $m$.
Examples:
* For $m=2$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1,2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192.
* For $m=3$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1, 2, 5, 13, 34, 89, 233, 610, 1597, 4181, 10946, 28657, 75025, 196418.
Matching statistic: St000686
(load all 43 compositions to match this statistic)
(load all 43 compositions to match this statistic)
St000686: 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,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,0,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 7 = 6 + 1
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> 4 = 3 + 1
Description
The finitistic dominant dimension of a Dyck path.
To every LNakayama algebra there is a corresponding Dyck path, see also [[St000684]]. We associate the finitistic dominant dimension of the algebra to the corresponding Dyck path.
Matching statistic: St001068
(load all 364 compositions to match this statistic)
(load all 364 compositions to match this statistic)
St001068: 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,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,0,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 7 = 6 + 1
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> 4 = 3 + 1
Description
Number of torsionless simple modules in the corresponding Nakayama algebra.
Matching statistic: St001203
(load all 129 compositions to match this statistic)
(load all 129 compositions to match this statistic)
St001203: 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,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,0,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 7 = 6 + 1
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> 4 = 3 + 1
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: St001733
(load all 139 compositions to match this statistic)
(load all 139 compositions to match this statistic)
St001733: 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,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,0,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 7 = 6 + 1
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> 4 = 3 + 1
Description
The number of weak left to right maxima of a Dyck path.
A weak left to right maximum is a peak whose height is larger than or equal to the height of all peaks to its
left.
Matching statistic: St000969
(load all 31 compositions to match this statistic)
(load all 31 compositions to match this statistic)
St000969: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 2 = 0 + 2
[1,0,1,0]
=> 3 = 1 + 2
[1,1,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0]
=> 4 = 2 + 2
[1,0,1,1,0,0]
=> 3 = 1 + 2
[1,1,0,1,0,0]
=> 3 = 1 + 2
[1,1,1,0,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,0,0]
=> 4 = 2 + 2
[1,0,1,1,0,1,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,0,0,0]
=> 3 = 1 + 2
[1,1,0,1,1,0,0,0]
=> 3 = 1 + 2
[1,1,1,0,1,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0,1,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,0,1,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,1,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,0,1,1,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,0,1,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,1,0,0,0,0]
=> 3 = 1 + 2
[1,1,0,1,1,1,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,0,1,1,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,0,1,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,1,0,0,0,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 7 = 5 + 2
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,1,0,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,0,1,1,0,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,1,0,1,0,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,0,1,1,0,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,1,1,0,0,0,0,0]
=> 3 = 1 + 2
[1,1,0,1,1,1,1,0,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,0,1,1,1,0,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,0,1,1,0,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,1,0,1,0,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 8 = 6 + 2
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 7 = 5 + 2
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 7 = 5 + 2
[1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> 5 = 3 + 2
Description
We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. Then we calculate the global dimension of that CNakayama algebra.
Matching statistic: St001028
(load all 127 compositions to match this statistic)
(load all 127 compositions to match this statistic)
St001028: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 2 = 0 + 2
[1,0,1,0]
=> 3 = 1 + 2
[1,1,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0]
=> 4 = 2 + 2
[1,0,1,1,0,0]
=> 3 = 1 + 2
[1,1,0,1,0,0]
=> 3 = 1 + 2
[1,1,1,0,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,0,0]
=> 4 = 2 + 2
[1,0,1,1,0,1,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,0,0,0]
=> 3 = 1 + 2
[1,1,0,1,1,0,0,0]
=> 3 = 1 + 2
[1,1,1,0,1,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0,1,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,0,1,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,1,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,0,1,1,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,0,1,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,1,0,0,0,0]
=> 3 = 1 + 2
[1,1,0,1,1,1,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,0,1,1,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,0,1,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,1,0,0,0,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 7 = 5 + 2
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,1,0,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,0,1,1,0,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,1,0,1,0,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,0,1,1,1,0,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,0,1,1,0,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,1,0,1,0,0,0,0]
=> 4 = 2 + 2
[1,0,1,1,1,1,1,0,0,0,0,0]
=> 3 = 1 + 2
[1,1,0,1,1,1,1,0,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,0,1,1,1,0,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,0,1,1,0,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,1,0,1,0,0,0,0,0]
=> 3 = 1 + 2
[1,1,1,1,1,1,0,0,0,0,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 8 = 6 + 2
[1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 7 = 5 + 2
[1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 7 = 5 + 2
[1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> 6 = 4 + 2
[1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> 5 = 3 + 2
[1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> 5 = 3 + 2
Description
Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path.
The following 911 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St000024The number of double up and double down steps of a Dyck path. St000340The number of non-final maximal constant sub-paths of length greater than one. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St000011The number of touch points (or returns) of a Dyck path. St000013The height of a Dyck path. St000025The number of initial rises of a Dyck path. St000105The number of blocks in the set partition. St000528The height of a poset. 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. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001343The dimension of the reduced incidence algebra of a poset. St001809The index of the step at the first peak of maximal height in a Dyck path. St000439The position of the first down step of a 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. St000008The major index of the composition. St000012The area of a Dyck path. St000018The number of inversions of a permutation. St000019The cardinality of the support of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000157The number of descents of a standard tableau. St000211The rank of the set partition. St000234The number of global ascents of a permutation. St000237The number of small exceedances. St000245The number of ascents of a permutation. St000272The treewidth of a graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000330The (standard) major index of a standard tableau. St000362The size of a minimal vertex cover of a graph. St000442The maximal area to the right of an up step of a Dyck path. St000536The pathwidth of a graph. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000996The number of exclusive left-to-right maxima of a permutation. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001090The number of pop-stack-sorts needed to sort a permutation. St001176The size of a partition minus its first part. St001484The number of singletons of an integer partition. 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. St001759The Rajchgot index of a permutation. St001777The number of weak descents in an integer composition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000010The length of the partition. St000026The position of the first return of a Dyck path. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000058The order 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. St000110The number of permutations less than or equal to a permutation in left weak order. St000147The largest part of an integer partition. St000167The number of leaves of an ordered tree. St000172The Grundy number of a graph. St000288The number of ones in a binary word. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000507The number of ascents of a standard tableau. St000527The width of the poset. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000676The number of odd rises of a Dyck path. St000734The last entry in the first row of a standard tableau. St000738The first entry in the last row of a standard tableau. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000759The smallest missing part in an integer partition. St000765The number of weak records in an integer composition. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000808The number of up steps of the associated bargraph. St000839The largest opener of a set partition. St000909The number of maximal chains of maximal size in a poset. St000932The number of occurrences of the pattern UDU in a Dyck path. St000971The smallest closer of a set partition. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001050The number of terminal closers of a set partition. St001058The breadth of the ordered tree. St001116The game chromatic number of a graph. St001389The number of partitions of the same length below the given integer partition. St001462The number of factors of a standard tableaux under concatenation. 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. St001720The minimal length of a chain of small intervals in a lattice. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St000521The number of distinct subtrees of an ordered tree. St001619The number of non-isomorphic sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St000009The charge of a standard tableau. St000059The inversion number of a standard tableau as defined by Haglund and Stevens. St000074The number of special entries. St000081The number of edges of a graph. St000141The maximum drop size of a permutation. St000148The number of odd parts of a partition. St000160The multiplicity of the smallest part of a partition. St000169The cocharge of a standard tableau. St000171The degree of the graph. St000214The number of adjacencies of a permutation. St000228The size of a partition. St000293The number of inversions of a binary word. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000377The dinv defect of an integer partition. St000384The maximal part of the shifted composition of an integer partition. St000441The number of successions of a permutation. St000445The number of rises of length 1 of a Dyck path. St000454The largest eigenvalue of a graph if it is integral. St000459The hook length of the base cell of a partition. St000475The number of parts equal to 1 in a partition. St000519The largest length of a factor maximising the subword complexity. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000546The number of global descents of a permutation. St000548The number of different non-empty partial sums of an integer partition. St000632The jump number of the poset. St000662The staircase size of the code of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000682The Grundy value of Welter's game on a binary word. St000692Babson and Steingrímsson's statistic of a permutation. St000703The number of deficiencies of a permutation. St000766The number of inversions of an integer composition. St000778The metric dimension of a graph. St000783The side length of the largest staircase partition fitting into a partition. St000784The maximum of the length and the largest part of the integer partition. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000867The sum of the hook lengths in the first row of an integer partition. St000984The number of boxes below precisely one peak. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001120The length of a longest path in a graph. St001127The sum of the squares of the parts of a partition. St001161The major index north count of a Dyck path. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001479The number of bridges of a graph. St001644The dimension of a graph. St001697The shifted natural comajor index of a standard Young tableau. St001826The maximal number of leaves on a vertex of a graph. St000007The number of saliances of the permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000054The first entry of the permutation. St000063The number of linear extensions of a certain poset defined for an integer partition. St000069The number of maximal elements of a poset. St000108The number of partitions contained in the given partition. St000153The number of adjacent cycles of a permutation. St000273The domination number of a graph. St000297The number of leading ones in a binary word. St000326The position of the first one in a binary word after appending a 1 at the end. St000363The number of minimal vertex covers of a graph. St000378The diagonal inversion number of an integer partition. St000383The last part of an integer composition. St000391The sum of the positions of the ones in a binary word. St000392The length of the longest run of ones in a binary word. St000395The sum of the heights of the peaks of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000451The length of the longest pattern of the form k 1 2. St000468The Hosoya index of a graph. St000505The biggest entry in the block containing the 1. St000532The total number of rook placements on a Ferrers board. St000544The cop number of a graph. St000693The modular (standard) major index of a standard tableau. St000700The protection number of an ordered tree. St000722The number of different neighbourhoods in a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000733The row containing the largest entry of a standard tableau. St000744The length of the path to the largest entry in a standard Young tableau. St000820The number of compositions obtained by rotating the composition. St000876The number of factors in the Catalan decomposition of a binary word. St000883The number of longest increasing subsequences of a permutation. St000885The number of critical steps in the Catalan decomposition of a binary word. St000916The packing number of a graph. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001313The number of Dyck paths above the lattice path given by a binary word. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001372The length of a longest cyclic run of ones of a binary word. St001400The total number of Littlewood-Richardson tableaux of given shape. St001415The length of the longest palindromic prefix of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001674The number of vertices of the largest induced star graph in the graph. St001725The harmonious chromatic number of a graph. St001829The common independence number of a graph. St001883The mutual visibility number of a graph. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000973The length of the boundary of an ordered tree. St000975The length of the boundary minus the length of the trunk of an ordered tree. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001279The sum of the parts of an integer partition that are at least two. St001486The number of corners of the ribbon associated with an integer composition. St000874The position of the last double rise in 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. St000502The number of successions of a set partitions. St000503The maximal difference between two elements in a common block. St000728The dimension of a set partition. St000730The maximal arc length of a set partition. St000877The depth of the binary word interpreted as a path. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000504The cardinality of the first block of a set partition. St000617The number of global maxima of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St001062The maximal size of a block of a set partition. St001717The largest size of an interval in a poset. St000209Maximum difference of elements in cycles. St000225Difference between largest and smallest parts in a partition. St000306The bounce count of a Dyck path. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000446The disorder of a permutation. St000492The rob statistic of a set partition. St000499The rcb statistic of a set partition. St000674The number of hills of a Dyck path. St000868The aid statistic in the sense of Shareshian-Wachs. St000946The sum of the skew hook positions in a Dyck path. St000947The major index east count of a Dyck path. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. 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. St001721The degree of a binary word. St001726The number of visible inversions of a permutation. St000144The pyramid weight of the Dyck path. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000420The number of Dyck paths that are weakly above a Dyck path. St000729The minimal arc length of a set partition. St000740The last entry of a permutation. St000823The number of unsplittable factors of the set partition. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001128The exponens consonantiae of a partition. St001268The size of the largest ordinal summand in the poset. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001399The distinguishing number of a poset. St001461The number of topologically connected components of the chord diagram of a permutation. St001463The number of distinct columns in the nullspace of a graph. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001779The order of promotion on the set of linear extensions of a poset. St001808The box weight or horizontal decoration of a Dyck path. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001814The number of partitions interlacing the given partition. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001498The normalised height of a Nakayama algebra with magnitude 1. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St000643The size of the largest orbit of antichains under Panyushev complementation. St000290The major index of a binary word. St000809The reduced reflection length of the permutation. St000956The maximal displacement of a permutation. St000957The number of Bruhat lower covers of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001083The number of boxed occurrences of 132 in a permutation. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001358The largest degree of a regular subgraph of a graph. St001485The modular major index of a binary word. St001962The proper pathwidth of a graph. St000100The number of linear extensions of a poset. St000485The length of the longest cycle of a permutation. St000654The first descent of a permutation. St000702The number of weak deficiencies of a permutation. St000822The Hadwiger number of the graph. St000844The size of the largest block in the direct sum decomposition of a permutation. St000910The number of maximal chains of minimal length in a poset. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001963The tree-depth of a graph. St000052The number of valleys of a Dyck path not on the x-axis. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. St001489The maximum of the number of descents and the number of inverse descents. St000470The number of runs in a permutation. St001316The domatic number of a graph. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St000159The number of distinct parts of the integer partition. St000354The number of recoils of a permutation. St000795The mad of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000831The number of indices that are either descents or recoils. St000833The comajor index of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St000495The number of inversions of distance at most 2 of a permutation. St001584The area statistic between a Dyck path and its bounce path. St001812The biclique partition number of a graph. St000907The number of maximal antichains of minimal length in a poset. St000911The number of maximal antichains of maximal size in a poset. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000931The number of occurrences of the pattern UUU in a Dyck path. St000989The number of final rises of a permutation. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001671Haglund's hag of a permutation. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000797The stat`` of a permutation. St000798The makl of a permutation. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001298The number of repeated entries in the Lehmer code of a permutation. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000308The height of the tree associated to 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. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001497The position of the largest weak excedence of a permutation. St001651The Frankl number of a lattice. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St000145The Dyson rank of a partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000653The last descent of a permutation. St000794The mak of a permutation. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001118The acyclic chromatic index of a graph. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001360The number of covering relations in Young's lattice below a partition. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001933The largest multiplicity of a part in an integer partition. St000667The greatest common divisor of the parts of the partition. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St000806The semiperimeter of the associated bargraph. St001267The length of the Lyndon factorization of the binary word. St000727The largest label of a leaf in the binary search tree associated with the permutation. St001280The number of parts of an integer partition that are at least two. St000161The sum of the sizes of the right subtrees of a binary tree. St000539The number of odd inversions of a permutation. St000651The maximal size of a rise in a permutation. St000983The length of the longest alternating subword. St000691The number of changes of a binary word. 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. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000389The number of runs of ones of odd length in a binary word. St000390The number of runs of ones in a binary word. St000143The largest repeated part of a partition. St000247The number of singleton blocks of a set partition. St000497The lcb statistic of a set partition. St000572The dimension exponent of a set partition. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000600The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, (1,3) are consecutive in a block. St000605The number of occurrences of the pattern {{1},{2,3}} such that 3 is maximal, (2,3) are consecutive in a block. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000614The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, 3 is maximal, (2,3) are consecutive in a block. St000742The number of big ascents of a permutation after prepending zero. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St001432The order dimension of the partition. St000365The number of double ascents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St000203The number of external nodes of a binary tree. St000474Dyson's crank of a partition. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000366The number of double descents of a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000908The length of the shortest maximal antichain in a poset. 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. St000331The number of upper interactions of a Dyck path. St000463The number of admissible inversions of a permutation. St000681The Grundy value of Chomp on Ferrers diagrams. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001397Number of pairs of incomparable elements in a finite poset. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St000015The number of peaks of a Dyck path. St000477The weight of a partition according to Alladi. St000770The major index of an integer partition when read from bottom to top. St000914The sum of the values of the Möbius function of a poset. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St001180Number of indecomposable injective modules with projective dimension at most 1. St000041The number of nestings of a perfect matching. St000246The number of non-inversions of a permutation. St000597The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, (2,3) are consecutive in a block. St000601The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, (2,3) are consecutive in a block. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000993The multiplicity of the largest part of an integer partition. St000356The number of occurrences of the pattern 13-2. St000586The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal. St000598The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, 3 is maximal, (2,3) are consecutive in a block. St000607The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 3 is maximal, (2,3) are consecutive in a block. St000609The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St000553The number of blocks of a graph. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001907The number of Bastidas - Hohlweg - Saliola excedances of a signed permutation. St000164The number of short pairs. St000843The decomposition number of a perfect matching. St000004The major index of a permutation. St000021The number of descents of a permutation. St000359The number of occurrences of the pattern 23-1. St000731The number of double exceedences of a permutation. St001427The number of descents of a signed permutation. St000981The length of the longest zigzag subpath. St000741The Colin de Verdière graph invariant. St001046The maximal number of arcs nesting a given arc of a perfect matching. St000628The balance of a binary word. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000982The length of the longest constant subword. St000065The number of entries equal to -1 in an alternating sign matrix. St000491The number of inversions of a set partition. St000496The rcs statistic of a set partition. St000522The number of 1-protected nodes of a rooted tree. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000332The positive inversions of an alternating sign matrix. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St000066The column of the unique '1' in the first row of the alternating sign matrix. St001330The hat guessing number of a graph. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St000067The inversion number of the alternating sign matrix. St000215The number of adjacencies of a permutation, zero appended. St000248The number of anti-singletons of a set partition. St000480The number of lower covers of a partition in dominance order. St000648The number of 2-excedences of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000542The number of left-to-right-minima of a permutation. St000501The size of the first part in the decomposition of a permutation. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St000022The number of fixed points of a permutation. St000369The dinv deficit of a Dyck path. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001778The largest greatest common divisor of an element and its image in a permutation. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra 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$. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St000080The rank of the poset. St000155The number of exceedances (also excedences) of a permutation. St000316The number of non-left-to-right-maxima 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. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St000062The length of the longest increasing subsequence of the permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000239The number of small weak excedances. St000314The number of left-to-right-maxima of a permutation. St000325The width of the tree associated to a permutation. St000335The difference of lower and upper interactions. St000443The number of long tunnels of a Dyck path. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. 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. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the 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. 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. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001530The depth of a Dyck path. 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. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000051The size of the left subtree of a binary tree. St000120The number of left tunnels of a Dyck path. St000133The "bounce" of a permutation. St000154The sum of the descent bottoms of a permutation. St000156The Denert index of a permutation. St000168The number of internal nodes of an ordered tree. St000204The number of internal nodes of a binary tree. St000224The sorting index of a permutation. St000238The number of indices that are not small weak excedances. St000305The inverse major index of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000336The leg major index of a standard tableau. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000796The stat' 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. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001077The prefix exchange distance of a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001185The number of indecomposable injective modules of grade at least 2 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$. 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. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001274The number of indecomposable injective modules with projective dimension equal to two. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001843The Z-index of a set partition. St000035The number of left outer peaks of a permutation. St000056The decomposition (or block) number of a permutation. St000084The number of subtrees. St000166The depth minus 1 of an ordered tree. St000240The number of indices that are not small excedances. St000328The maximum number of child nodes in a tree. St000638The number of up-down runs of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000990The first ascent of a permutation. St000991The number of right-to-left minima of a permutation. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in 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. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001481The minimal height of a peak of a Dyck path. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St000094The depth of an ordered tree. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000057The Shynar inversion number of a standard tableau. St000076The rank of the alternating sign matrix in the alternating sign matrix poset. St000089The absolute variation of a composition. St000091The descent variation of a composition. St000118The number of occurrences of the contiguous pattern [.,[.,[.,.]]] in a binary tree. St000223The number of nestings in the permutation. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000304The load of a permutation. St000310The minimal degree of a vertex of a graph. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000339The maf index of a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000386The number of factors DDU in a Dyck path. St000803The number of occurrences of the vincular pattern |132 in a permutation. St001047The maximal number of arcs crossing a given arc of a perfect matching. St001115The number of even descents of a permutation. St001117The game chromatic index of a graph. St001119The length of a shortest maximal path in a graph. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001153The number of blocks with even minimum in a set partition. St001172The number of 1-rises at odd height of a Dyck path. St001175The size of a partition minus the hook length of the base cell. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001357The maximal degree of a regular spanning subgraph of a graph. St001391The disjunction number of a graph. St001428The number of B-inversions of a signed permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001781The interlacing number of a set partition. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001841The number of inversions of a set partition. St001869The maximum cut size of a graph. St001949The rigidity index of a graph. St000086The number of subgraphs. St000087The number of induced subgraphs. St000201The number of leaf nodes in a binary tree. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000352The Elizalde-Pak rank of a permutation. St000469The distinguishing number of a graph. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000636The hull number of a graph. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000926The clique-coclique number of a graph. St001342The number of vertices in the center of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001645The pebbling number of a connected graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001746The coalition number of a graph. St001828The Euler characteristic of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St000300The number of independent sets of vertices of a graph. St000301The number of facets of the stable set polytope of a graph. St000083The number of left oriented leafs of a binary tree except the first one. St001480The number of simple summands of the module J^2/J^3. St001959The product of the heights of the peaks of a Dyck path. St000216The absolute length of a permutation. St000061The number of nodes on the left branch of a binary tree. St000280The size of the preimage of the map 'to labelling permutation' from Parking functions to Permutations. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001346The number of parking functions that give the same permutation. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St000462The major index minus the number of excedences of a permutation. St000472The sum of the ascent bottoms of a permutation. St000619The number of cyclic descents of a permutation. St000862The number of parts of the shifted shape of a permutation. St000873The aix statistic of a permutation. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001377The major index minus the number of inversions of a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001911A descent variant minus the number of inversions. St000082The number of elements smaller than a binary tree in Tamari order. St000236The number of cyclical small weak excedances. St000338The number of pixed points of a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St000142The number of even parts of a partition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000764The number of strong records in an integer composition. St001091The number of parts in an integer partition whose next smaller part has the same size. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St000758The length of the longest staircase fitting into an integer composition. St000767The number of runs in an integer composition. St000903The number of different parts of an integer composition. St000761The number of ascents in an integer composition. St000494The number of inversions of distance at most 3 of a permutation. St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. St000840The number of closers smaller than the largest opener in a perfect matching. St001875The number of simple modules with projective dimension at most 1. St000119The number of occurrences of the pattern 321 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000317The cycle descent number of a permutation. St000837The number of ascents of distance 2 of a permutation. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St001323The independence gap of a graph. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000652The maximal difference between successive positions of a permutation. St000924The number of topologically connected components of a perfect matching. St000312The number of leaves in a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000961The shifted major index of a permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra 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. 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. 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). St000711The number of big exceedences of a permutation. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000746The number of pairs with odd minimum in a perfect matching. St000090The variation of a composition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000646The number of big ascents of a permutation. St000358The number of occurrences of the pattern 31-2. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001741The largest integer such that all patterns of this size are contained in the permutation. St001948The number of augmented double ascents of a permutation. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000200The row of the unique '1' in the last column of the alternating sign matrix. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001960The number of descents of a permutation minus one if its first entry is not one. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St000185The weighted size of a partition. St000355The number of occurrences of the pattern 21-3. St000426The number of occurrences of the pattern 132 or of the pattern 312 in a permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000538The number of even inversions of a permutation. St000710The number of big deficiencies of a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000836The number of descents of distance 2 of a permutation. St001082The number of boxed occurrences of 123 in a permutation. St000146The Andrews-Garvan crank of a partition. St000988The orbit size of a permutation under Foata's bijection. St001246The maximal difference between two consecutive entries of a permutation. St001430The number of positive entries in a signed permutation. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St000039The number of crossings of a permutation. St000732The number of double deficiencies of a permutation. St001152The number of pairs with even minimum in a perfect matching. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001684The reduced word complexity of a permutation. St001727The number of invisible inversions of a permutation. St000060The greater neighbor of the maximum. St000193The row of the unique '1' in the first column of the alternating sign matrix. St001589The nesting number of a perfect matching. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000217The number of occurrences of the pattern 312 in a permutation. St000221The number of strong fixed points of a permutation. St000222The number of alignments in the permutation. St000241The number of cyclical small excedances. St000242The number of indices that are not cyclical small weak excedances. St000430The number of occurrences of the pattern 123 or of the pattern 312 in a permutation. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. 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. St001214The aft of an integer partition. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001411The number of patterns 321 or 3412 in a permutation. St001429The number of negative entries in a signed permutation. St001434The number of negative sum pairs of a signed permutation. St001511The minimal number of transpositions needed to sort a permutation in either direction. St001552The number of inversions between excedances and fixed points of a permutation. St000181The number of connected components of the Hasse diagram for the poset. St001136The largest label with larger sister in the leaf labelled binary unordered tree associated with the perfect matching. St001220The width of a permutation. St001555The order of a signed permutation. St001590The crossing number of a perfect matching. St000673The number of non-fixed points of a permutation. St000756The sum of the positions of the left to right maxima of a permutation. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001668The number of points of the poset minus the width of the poset. St000327The number of cover relations in a poset. St001487The number of inner corners of a skew partition. St000898The number of maximal entries in the last diagonal of the monotone triangle. St001435The number of missing boxes in the first row. St001863The number of weak excedances of a signed permutation. St001889The size of the connectivity set of a signed permutation. St001861The number of Bruhat lower covers of a permutation. St000647The number of big descents of a permutation. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St001769The reflection length of a signed permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001864The number of excedances of a signed permutation. St001866The nesting alignments of a signed permutation. St001894The depth of a signed permutation. St001896The number of right descents of a signed permutations. St000455The second largest eigenvalue of a graph if it is integral. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001855The number of signed permutations less than or equal to a signed permutation in left weak order. St000896The number of zeros on the main diagonal of an alternating sign matrix. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001820The size of the image of the pop stack sorting operator. St000884The number of isolated descents of a permutation. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001596The number of two-by-two squares inside a skew partition. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001712The number of natural descents of a standard Young tableau. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001060The distinguishing index of a graph. St000670The reversal length of a permutation. St001877Number of indecomposable injective modules with projective dimension 2. St001624The breadth of a lattice. St000456The monochromatic index of a connected graph. St000963The 2-shifted major index of a permutation. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001893The flag descent of a signed permutation. 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. St001557The number of inversions of the second entry of a permutation. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St000942The number of critical left to right maxima of the parking functions. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001904The length of the initial strictly increasing segment of a parking function. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000360The number of occurrences of the pattern 32-1. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000665The number of rafts of a permutation. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001811The Castelnuovo-Mumford regularity of a permutation. St001821The sorting index of a signed permutation. St001874Lusztig's a-function for the symmetric group. St001905The number of preferred parking spots in a parking function less than the index of the car. St001964The interval resolution global dimension of a poset. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001937The size of the center of a parking function. St000824The sum of the number of descents and the number of recoils of a permutation. St001760The number of prefix or suffix reversals needed to sort a permutation. St000235The number of indices that are not cyclical small weak excedances. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St000493The los statistic of a set partition. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001488The number of corners of a skew partition. St001626The number of maximal proper sublattices of a lattice. St001867The number of alignments of type EN of a signed permutation. St001096The size of the overlap set of a permutation. St001621The number of atoms of a lattice. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000568The hook number of a binary tree. St000659The number of rises of length at least 2 of a Dyck path. St000919The number of maximal left branches of a binary tree. St001732The number of peaks visible from the left. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. 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$. St001394The genus of a permutation. St001052The length of the exterior of a permutation. St000850The number of 1/2-balanced pairs in a poset. St001075The minimal size of a block of a set partition. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000307The number of rowmotion orbits of a poset. St000490The intertwining number of a set partition. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000023The number of inner peaks of a permutation. St000353The number of inner valleys of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000663The number of right floats of a permutation. St001469The holeyness of a permutation. St001470The cyclic holeyness of a permutation. St001840The number of descents of a set partition. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St001737The number of descents of type 2 in a permutation. St000173The segment statistic of a semistandard tableau. St000174The flush statistic of a semistandard tableau. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000260The radius of a connected graph. St000562The number of internal points of a set partition. St000565The major index of a set partition. St000589The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal, (2,3) are consecutive in a block. St000624The normalized sum of the minimal distances to a greater element. St000640The rank of the largest boolean interval in a poset. St000650The number of 3-rises of a permutation. St000779The tier of a permutation. St000872The number of very big descents of a permutation. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001114The number of odd descents of a permutation. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001171The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001388The number of non-attacking neighbors of a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001423The number of distinct cubes in a binary word. St001520The number of strict 3-descents. St001556The number of inversions of the third entry of a permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. St001665The number of pure excedances of a permutation. St001728The number of invisible descents of a permutation. St001729The number of visible descents of a permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St001823The Stasinski-Voll length of a signed permutation. St001839The number of excedances of a set partition. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001862The number of crossings of a signed permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001928The number of non-overlapping descents in a permutation. St000254The nesting number of a set partition. St000387The matching number of a graph. St000498The lcs statistic of a set partition. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001354The number of series nodes in the modular decomposition of a graph. St001393The induced matching number of a graph. St001405The number of bonds in a permutation. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001512The minimum rank of a graph. St001734The lettericity of a graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St000918The 2-limited packing number of a graph. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001261The Castelnuovo-Mumford regularity of a graph. St001471The magnitude of a Dyck path. St001902The number of potential covers of a poset. St000230Sum of the minimal elements of the blocks of a set partition. St000735The last entry on the main diagonal of a standard tableau. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001876The number of 2-regular simple modules in the incidence algebra of the lattice.
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!