searching the database
Your data matches 725 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: St000684
(load all 15 compositions to match this statistic)
(load all 15 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000684: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000684: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> 2
[2]
=> [1,1,0,0,1,0]
=> 2
[1,1]
=> [1,0,1,1,0,0]
=> 2
[3]
=> [1,1,1,0,0,0,1,0]
=> 2
[2,1]
=> [1,0,1,0,1,0]
=> 3
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 2
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> 3
[2,2]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 3
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 2
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
[3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 2
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 3
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 3
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
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 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000686: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000686: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> 2
[2]
=> [1,1,0,0,1,0]
=> 2
[1,1]
=> [1,0,1,1,0,0]
=> 2
[3]
=> [1,1,1,0,0,0,1,0]
=> 2
[2,1]
=> [1,0,1,0,1,0]
=> 3
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 2
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> 3
[2,2]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 3
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 2
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
[3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 2
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 3
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 3
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
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: St001296
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001296: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001296: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> 1 = 2 - 1
[2]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[3]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[2,1]
=> [1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1 = 2 - 1
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
Description
The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra.
See [[http://www.findstat.org/DyckPaths/NakayamaAlgebras]].
Matching statistic: St001483
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001483: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001483: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> 1 = 2 - 1
[2]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[3]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[2,1]
=> [1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1 = 2 - 1
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
Description
The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module.
Matching statistic: St001503
(load all 37 compositions to match this statistic)
(load all 37 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001503: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001503: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> 1 = 2 - 1
[2]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[3]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[2,1]
=> [1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1 = 2 - 1
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
Description
The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra.
Matching statistic: St001732
(load all 51 compositions to match this statistic)
(load all 51 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001732: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001732: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> 1 = 2 - 1
[2]
=> [1,0,1,0]
=> 1 = 2 - 1
[1,1]
=> [1,1,0,0]
=> 1 = 2 - 1
[3]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[2,1]
=> [1,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2 = 3 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
Description
The number of peaks visible from the left.
This is, the number of left-to-right maxima of the heights of the peaks of a Dyck path.
Matching statistic: St000481
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000481: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000481: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> []
=> 0 = 2 - 2
[2]
=> []
=> 0 = 2 - 2
[1,1]
=> [1]
=> 0 = 2 - 2
[3]
=> []
=> 0 = 2 - 2
[2,1]
=> [1]
=> 0 = 2 - 2
[1,1,1]
=> [1,1]
=> 1 = 3 - 2
[4]
=> []
=> 0 = 2 - 2
[3,1]
=> [1]
=> 0 = 2 - 2
[2,2]
=> [2]
=> 0 = 2 - 2
[2,1,1]
=> [1,1]
=> 1 = 3 - 2
[1,1,1,1]
=> [1,1,1]
=> 1 = 3 - 2
[5]
=> []
=> 0 = 2 - 2
[4,1]
=> [1]
=> 0 = 2 - 2
[3,2]
=> [2]
=> 0 = 2 - 2
[3,1,1]
=> [1,1]
=> 1 = 3 - 2
[2,2,1]
=> [2,1]
=> 1 = 3 - 2
[2,1,1,1]
=> [1,1,1]
=> 1 = 3 - 2
[1,1,1,1,1]
=> [1,1,1,1]
=> 1 = 3 - 2
Description
The number of upper covers of a partition in dominance order.
Matching statistic: St001022
(load all 51 compositions to match this statistic)
(load all 51 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001022: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001022: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> 0 = 2 - 2
[2]
=> [1,1,0,0,1,0]
=> 0 = 2 - 2
[1,1]
=> [1,0,1,1,0,0]
=> 0 = 2 - 2
[3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 2 - 2
[2,1]
=> [1,0,1,0,1,0]
=> 1 = 3 - 2
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 2 - 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 3 - 2
[2,2]
=> [1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 1 = 3 - 2
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 2 - 2
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0 = 2 - 2
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1 = 3 - 2
[3,2]
=> [1,1,0,0,1,0,1,0]
=> 1 = 3 - 2
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 2 - 2
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 1 = 3 - 2
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1 = 3 - 2
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 0 = 2 - 2
Description
Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001167
(load all 19 compositions to match this statistic)
(load all 19 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001167: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001167: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> 0 = 2 - 2
[2]
=> [1,1,0,0,1,0]
=> 0 = 2 - 2
[1,1]
=> [1,0,1,1,0,0]
=> 0 = 2 - 2
[3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 2 - 2
[2,1]
=> [1,0,1,0,1,0]
=> 1 = 3 - 2
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 2 - 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 3 - 2
[2,2]
=> [1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 1 = 3 - 2
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 2 - 2
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0 = 2 - 2
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1 = 3 - 2
[3,2]
=> [1,1,0,0,1,0,1,0]
=> 1 = 3 - 2
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 2 - 2
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 1 = 3 - 2
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1 = 3 - 2
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 0 = 2 - 2
Description
The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra.
The top of a module is the cokernel of the inclusion of the radical of the module into the module.
For Nakayama algebras with at most 8 simple modules, the statistic also coincides with the number of simple modules with projective dimension at least 3 in the corresponding Nakayama algebra.
Matching statistic: St001253
(load all 19 compositions to match this statistic)
(load all 19 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001253: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001253: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> 0 = 2 - 2
[2]
=> [1,1,0,0,1,0]
=> 0 = 2 - 2
[1,1]
=> [1,0,1,1,0,0]
=> 0 = 2 - 2
[3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 2 - 2
[2,1]
=> [1,0,1,0,1,0]
=> 1 = 3 - 2
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 2 - 2
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 2 - 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 3 - 2
[2,2]
=> [1,1,0,0,1,1,0,0]
=> 0 = 2 - 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 1 = 3 - 2
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 2 - 2
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0 = 2 - 2
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1 = 3 - 2
[3,2]
=> [1,1,0,0,1,0,1,0]
=> 1 = 3 - 2
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 2 - 2
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 1 = 3 - 2
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1 = 3 - 2
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 0 = 2 - 2
Description
The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra.
For the first 196 values the statistic coincides also with the number of fixed points of $\tau \Omega^2$ composed with its inverse, see theorem 5.8. in the reference for more details.
The number of Dyck paths of length n where the statistics returns zero seems to be 2^(n-1).
The following 715 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000013The height of a Dyck path. St000444The length of the maximal rise of a Dyck path. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows:
St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000028The number of stack-sorts needed to sort a permutation. St000035The number of left outer peaks of a permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000124The cardinality of the preimage of the Simion-Schmidt map. St000201The number of leaf nodes in a binary tree. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000306The bounce count of a Dyck path. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000396The register function (or Horton-Strahler number) of a binary tree. St000442The maximal area to the right of an up step of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000679The pruning number of an ordered tree. St000701The protection number of a binary tree. St000758The length of the longest staircase fitting into an integer composition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000764The number of strong records in an integer composition. St000767The number of runs in an integer composition. St000834The number of right outer peaks of a permutation. St000862The number of parts of the shifted shape of a permutation. St000886The number of permutations with the same antidiagonal sums. St000903The number of different parts of an integer composition. St000920The logarithmic height of a Dyck path. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001729The number of visible descents of a permutation. St001928The number of non-overlapping descents in a permutation. St000023The number of inner peaks of a permutation. St000024The number of double up and double down steps of a Dyck path. St000039The number of crossings of a permutation. St000052The number of valleys of a Dyck path not on the x-axis. St000150The floored half-sum of the multiplicities of a partition. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000257The number of distinct parts of a partition that occur at least twice. St000358The number of occurrences of the pattern 31-2. St000386The number of factors DDU in a Dyck path. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000480The number of lower covers of a partition in dominance order. St000486The number of cycles of length at least 3 of a permutation. St000534The number of 2-rises of a permutation. St000547The number of even non-empty partial sums of an integer partition. St000647The number of big descents of a permutation. St000650The number of 3-rises of a permutation. St000660The number of rises of length at least 3 of a Dyck path. St000661The number of rises of length 3 of a Dyck path. St000710The number of big deficiencies of a permutation. St000731The number of double exceedences of a permutation. St000761The number of ascents in an integer composition. St000779The tier of a permutation. St000931The number of occurrences of the pattern UUU in a Dyck path. St000932The number of occurrences of the pattern UDU in a Dyck path. 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. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. 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. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001423The number of distinct cubes in a binary word. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001673The degree of asymmetry of an integer composition. St001727The number of invisible inversions of a permutation. St001728The number of invisible descents of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St000007The number of saliances of the permutation. St000011The number of touch points (or returns) of a Dyck path. St000015The number of peaks of a Dyck path. St000058The order of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000166The depth minus 1 of an ordered tree. St000308The height of the tree associated to a permutation. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000325The width of the tree associated to a permutation. St000381The largest part of an integer composition. St000392The length of the longest run of ones in a binary word. St000397The Strahler number of a rooted tree. St000451The length of the longest pattern of the form k 1 2. St000470The number of runs in a permutation. St000485The length of the longest cycle of a permutation. St000527The width of the poset. St000528The height of a poset. St000542The number of left-to-right-minima of a permutation. St000702The number of weak deficiencies of a permutation. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St000808The number of up steps of the associated bargraph. St000822The Hadwiger number of the graph. St000891The number of distinct diagonal sums of a permutation matrix. St000925The number of topologically connected components of a set partition. St000969We 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}$. St000982The length of the longest constant subword. St000991The number of right-to-left minima of a permutation. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001062The maximal size of a block of a set partition. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001108The 2-dynamic chromatic number of a graph. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. 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$. 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. 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$. 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. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001343The dimension of the reduced incidence algebra of a poset. St001372The length of a longest cyclic run of ones of a binary word. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001471The magnitude of a Dyck path. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000021The number of descents of a permutation. St000053The number of valleys of the Dyck path. St000068The number of minimal elements in a poset. St000071The number of maximal chains in a poset. St000078The number of alternating sign matrices whose left key is the permutation. St000080The rank of the poset. St000094The depth of an ordered tree. St000100The number of linear extensions of a poset. St000141The maximum drop size of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000159The number of distinct parts of the integer partition. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000216The absolute length of a permutation. St000251The number of nonsingleton blocks of a set partition. St000255The number of reduced Kogan faces with the permutation as type. St000272The treewidth of a graph. St000297The number of leading ones in a binary word. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. St000340The number of non-final maximal constant sub-paths of length greater than one. St000346The number of coarsenings of a partition. St000352The Elizalde-Pak rank of a permutation. St000354The number of recoils of a permutation. St000388The number of orbits of vertices of a graph under automorphisms. St000390The number of runs of ones in a binary word. St000413The number of ordered trees with the same underlying unordered tree. St000521The number of distinct subtrees of an ordered tree. St000522The number of 1-protected nodes of a rooted tree. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000536The pathwidth of a graph. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000628The balance of a binary word. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St000654The first descent of a permutation. St000662The staircase size of the code of a permutation. St000669The number of permutations obtained by switching ascents or descents of size 2. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000700The protection number of an ordered tree. St000703The number of deficiencies of a permutation. St000742The number of big ascents of a permutation after prepending zero. 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. St000765The number of weak records in an integer composition. St000783The side length of the largest staircase partition fitting into a partition. St000789The number of crossing-similar perfect matchings of a perfect matching. St000805The number of peaks of the associated bargraph. 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. St000829The Ulam distance of a permutation to the identity permutation. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000864The number of circled entries of the shifted recording tableau of a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000889The number of alternating sign matrices with the same antidiagonal sums. St000899The maximal number of repetitions of an integer composition. St000900The minimal number of repetitions of a part in an integer composition. St000902 The minimal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000905The number of different multiplicities of parts of an integer composition. St000909The number of maximal chains of maximal size in a poset. St000910The number of maximal chains of minimal length in a poset. St000919The number of maximal left branches of a binary tree. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000996The number of exclusive left-to-right maxima 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. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001052The length of the exterior of a permutation. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001096The size of the overlap set of a permutation. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001111The weak 2-dynamic chromatic number of a graph. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001151The number of blocks with odd minimum. 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. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module 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. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001220The width of a permutation. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. 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. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001268The size of the largest ordinal summand in the poset. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001277The degeneracy of a graph. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001281The normalized isoperimetric number of a graph. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001298The number of repeated entries in the Lehmer code of a permutation. St001352The number of internal nodes in the modular decomposition of a graph. St001358The largest degree of a regular subgraph of a graph. St001399The distinguishing number of a poset. St001432The order dimension of the partition. St001487The number of inner corners of a skew partition. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001597The Frobenius rank of a skew partition. St001665The number of pure excedances of a permutation. St001716The 1-improper chromatic number of a graph. St001733The number of weak left to right maxima of a Dyck path. St001734The lettericity of a graph. St001735The number of permutations with the same set of runs. St001737The number of descents of type 2 in a permutation. St001741The largest integer such that all patterns of this size are contained in the permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001779The order of promotion on the set of linear extensions of a poset. 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. St001792The arboricity of a graph. St001874Lusztig's a-function for the symmetric group. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000002The number of occurrences of the pattern 123 in a permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000065The number of entries equal to -1 in an alternating sign matrix. St000091The descent variation of a composition. St000119The number of occurrences of the pattern 321 in a permutation. St000122The number of occurrences of the contiguous pattern [.,[.,[[.,.],.]]] in a binary tree. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000142The number of even parts of a partition. St000143The largest repeated part of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000185The weighted size of a partition. St000204The number of internal nodes of a binary tree. St000217The number of occurrences of the pattern 312 in a permutation. St000218The number of occurrences of the pattern 213 in a permutation. St000220The number of occurrences of the pattern 132 in a permutation. St000223The number of nestings in the permutation. St000237The number of small exceedances. St000245The number of ascents of a permutation. St000252The number of nodes of degree 3 of a binary tree. St000256The number of parts from which one can substract 2 and still get an integer partition. St000292The number of ascents of a binary word. St000317The cycle descent number of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000339The maf index of a permutation. St000353The number of inner valleys of a permutation. St000355The number of occurrences of the pattern 21-3. St000356The number of occurrences of the pattern 13-2. St000357The number of occurrences of the pattern 12-3. St000359The number of occurrences of the pattern 23-1. St000360The number of occurrences of the pattern 32-1. St000365The number of double ascents of a permutation. St000366The number of double descents of a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000374The number of exclusive right-to-left minima of a permutation. St000423The number of occurrences of the pattern 123 or of the pattern 132 in a permutation. St000428The number of occurrences of the pattern 123 or of the pattern 213 in a permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000445The number of rises of length 1 of a Dyck path. St000446The disorder of a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000496The rcs statistic of a set partition. St000523The number of 2-protected nodes of a rooted tree. St000538The number of even inversions of a permutation. St000552The number of cut vertices of a graph. St000561The number of occurrences of the pattern {{1,2,3}} in a set partition. St000624The normalized sum of the minimal distances to a greater element. St000632The jump number of the poset. St000646The number of big ascents of a permutation. St000648The number of 2-excedences of a permutation. St000663The number of right floats of a permutation. St000664The number of right ropes of a permutation. St000671The maximin edge-connectivity for choosing a subgraph. St000672The number of minimal elements in Bruhat order not less than the permutation. St000709The number of occurrences of 14-2-3 or 14-3-2. St000711The number of big exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000766The number of inversions of an integer composition. St000768The number of peaks in an integer composition. St000769The major index of a composition regarded as a word. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000807The sum of the heights of the valleys of the associated bargraph. St000836The number of descents of distance 2 of a permutation. St000837The number of ascents of distance 2 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. St000850The number of 1/2-balanced pairs in a poset. St000871The number of very big ascents of a permutation. St000872The number of very big descents of a permutation. St000879The number of long braid edges in the graph of braid moves of a permutation. St000884The number of isolated descents of a permutation. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. 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. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001082The number of boxed occurrences of 123 in a permutation. St001083The number of boxed occurrences of 132 in a permutation. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001090The number of pop-stack-sorts needed to sort a permutation. St001091The number of parts in an integer partition whose next smaller part has the same size. St001092The number of distinct even parts of a partition. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001115The number of even descents of a permutation. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. 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. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001234The number of indecomposable three dimensional modules with projective dimension one. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001331The size of the minimal feedback vertex set. St001335The cardinality of a minimal cycle-isolating set of a graph. St001394The genus of a permutation. St001396Number of triples of incomparable elements in a finite poset. St001397Number of pairs of incomparable elements in a finite poset. St001411The number of patterns 321 or 3412 in a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001469The holeyness of a permutation. St001484The number of singletons of an integer partition. St001489The maximum of the number of descents and the number of inverse descents. St001549The number of restricted non-inversions between exceedances. St001552The number of inversions between excedances and fixed points of a permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. 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. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001689The number of celebrities in a graph. St001695The natural comajor index of a standard Young tableau. St001712The number of natural descents of a standard Young tableau. St001726The number of visible inversions of a permutation. St001730The number of times the path corresponding to a binary word crosses the base line. St001731The factorization defect of a permutation. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001777The number of weak descents in an integer composition. St001801Half the number of preimage-image pairs of different parity in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001842The major index of a set partition. St001931The weak major index of an integer composition regarded as a word. St000568The hook number of a binary tree. St000219The number of occurrences of the pattern 231 in a permutation. St000893The number of distinct diagonal sums of an alternating sign matrix. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000402Half the size of the symmetry class of a permutation. St000526The number of posets with combinatorially isomorphic order polytopes. St000619The number of cyclic descents of a permutation. St000630The length of the shortest palindromic decomposition of a binary word. St000652The maximal difference between successive positions of a permutation. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000983The length of the longest alternating subword. St000988The orbit size of a permutation under Foata's bijection. St001081The number of minimal length factorizations of a permutation into star transpositions. St001884The number of borders of a binary word. St000291The number of descents of a binary word. St000491The number of inversions of a set partition. St000539The number of odd inversions of a permutation. St000565The major index of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. 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. 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. 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. 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. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000691The number of changes of a binary word. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000961The shifted major index of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001388The number of non-attacking neighbors of a permutation. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001557The number of inversions of the second entry of a permutation. St001811The Castelnuovo-Mumford regularity of a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001556The number of inversions of the third entry of a permutation. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. 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$. St001589The nesting number of a perfect matching. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001569The maximal modular displacement of a permutation. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. 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). St001948The number of augmented double ascents of a permutation. St000649The number of 3-excedences of a permutation. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000962The 3-shifted major index of a permutation. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001520The number of strict 3-descents. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000295The length of the border of a binary word. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000455The second largest eigenvalue of a graph if it is integral. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001863The number of weak excedances of a signed permutation. St000259The diameter of a connected graph. St001571The Cartan determinant of the integer partition. St001260The permanent of an alternating sign matrix. St000439The position of the first down step of a Dyck path. St001180Number of indecomposable injective modules with projective dimension at most 1. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St000203The number of external nodes of a binary tree. St000443The number of long tunnels of a Dyck path. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000495The number of inversions of distance at most 2 of a permutation. St000638The number of up-down runs of a permutation. St000676The number of odd rises of a Dyck path. St000738The first entry in the last row of a standard tableau. St000746The number of pairs with odd minimum in a perfect matching. St000797The stat`` of a permutation. St000876The number of factors in the Catalan decomposition of a binary word. St001007Number of simple modules with projective dimension 1 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. 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. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. 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. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001288The number of primes obtained by multiplying preimage and image of a permutation and adding one. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. 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. St001461The number of topologically connected components of the chord diagram of a permutation. St001497The position of the largest weak excedence of a permutation. 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. St001523The degree of symmetry of a Dyck path. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001864The number of excedances of a signed permutation. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. 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)$. St001862The number of crossings of a signed permutation. St001871The number of triconnected components of a graph. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001462The number of factors of a standard tableaux under concatenation. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St000942The number of critical left to right maxima of the parking functions. St001060The distinguishing index of a graph. St001267The length of the Lyndon factorization of the binary word. St001330The hat guessing number of a graph. St001488The number of corners of a skew partition. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001530The depth of a Dyck path. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St000260The radius of a connected graph. St000820The number of compositions obtained by rotating the composition. St001114The number of odd descents of a permutation. St001470The cyclic holeyness of a permutation. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001820The size of the image of the pop stack sorting operator. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St001896The number of right descents of a signed permutations. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St001130The number of two successive successions in a permutation. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. 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. St001846The number of elements which do not have a complement in the lattice. St001966Half the global dimension of the stable Auslander algebra of a sincere Nakayama algebra (with associated Dyck path). St000031The number of cycles in the cycle decomposition of a permutation. St000181The number of connected components of the Hasse diagram for the poset. St000454The largest eigenvalue of a graph if it is integral. St001490The number of connected components of a skew partition. St001890The maximum magnitude of the Möbius function of a poset. St001435The number of missing boxes in the first row. St001964The interval resolution global dimension of a poset. St000075The orbit size of a standard tableau under promotion. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000842The breadth of a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St000264The girth of a graph, which is not a tree. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. 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. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001182Number of indecomposable injective modules with codominant dimension at least two 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 St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001162The minimum jump of a permutation. St001344The neighbouring number of a permutation. St000090The variation of a composition. St000233The number of nestings of a set partition. St000338The number of pixed points of a permutation. St001438The number of missing boxes of a skew partition. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001705The number of occurrences of the pattern 2413 in a permutation. St001857The number of edges in the reduced word graph of a signed permutation. St001866The nesting alignments of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St000806The semiperimeter of the associated bargraph. St001624The breadth of a lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000456The monochromatic index of a connected graph. St000741The Colin de Verdière graph invariant. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St001713The difference of the first and last value in the first row of the Gelfand-Tsetlin pattern. St000022The number of fixed points of a permutation. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000546The number of global descents of a permutation. St001875The number of simple modules with projective dimension at most 1. St000056The decomposition (or block) number of a permutation. St000084The number of subtrees. St000105The number of blocks in the set partition. St000236The number of cyclical small weak excedances. St000239The number of small weak excedances. St000241The number of cyclical small excedances. St000248The number of anti-singletons of a set partition. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St000253The crossing number of a set partition. St000314The number of left-to-right-maxima of a permutation. St000328The maximum number of child nodes in a tree. St000487The length of the shortest cycle of a permutation. St000502The number of successions of a set partitions. St000504The cardinality of the first block of a set partition. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000574The number of occurrences of the pattern {{1},{2}} such that 1 is a minimal and 2 a maximal element. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001075The minimal size of a block of a set partition. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001498The normalised height of a Nakayama algebra with magnitude 1. St001545The second Elser number of a connected graph. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001905The number of preferred parking spots in a parking function less than the index of the car. St000154The sum of the descent bottoms of a permutation. St000210Minimum over maximum difference of elements in cycles. St000234The number of global ascents of a permutation. St000563The number of overlapping pairs of blocks of a set partition. St000570The Edelman-Greene number of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St000729The minimal arc length of a set partition. St000824The sum of the number of descents and the number of recoils of a permutation. St000831The number of indices that are either descents or recoils. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St000990The first ascent of a permutation. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001424The number of distinct squares in a binary word. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001781The interlacing number of a set partition. St001805The maximal overlap of a cylindrical tableau associated with a semistandard tableau. St001806The upper middle entry of a permutation. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001889The size of the connectivity set of a signed permutation. St000188The area of the Dyck path corresponding to a parking function and the total displacement of a parking function. St000195The number of secondary dinversion pairs of the dyck path corresponding to a parking function. St000221The number of strong fixed points of a permutation. St000247The number of singleton blocks of a set partition. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000367The number of simsun double descents of a permutation. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000432The number of occurrences of the pattern 231 or of the pattern 312 in a permutation. St000462The major index minus the number of excedences of a permutation. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000516The number of stretching pairs of a permutation. St000557The number of occurrences of the pattern {{1},{2},{3}} in a set partition. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000573The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton and 2 a maximal element. St000575The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element and 2 a singleton. St000576The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal and 2 a minimal element. St000578The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton. St000580The number of occurrences of the pattern {{1},{2},{3}} such that 2 is minimal, 3 is maximal. St000583The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1, 2 are maximal. St000584The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal, 3 is maximal. St000587The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal. St000588The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are minimal, 2 is maximal. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,3) are consecutive in a block. St000591The number of occurrences of the pattern {{1},{2},{3}} such that 2 is maximal. St000592The number of occurrences of the pattern {{1},{2},{3}} such that 1 is maximal. St000593The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal. St000596The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1 is maximal. St000603The number of occurrences of the pattern {{1},{2},{3}} such that 2,3 are minimal. St000604The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 2 is maximal. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St000615The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are maximal. St000623The number of occurrences of the pattern 52341 in a permutation. St000666The number of right tethers of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000943The number of spots the most unlucky car had to go further in a parking function. St000963The 2-shifted major index of a permutation. St000989The number of final rises of a permutation. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001301The first Betti number of the order complex associated with the poset. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001371The length of the longest Yamanouchi prefix of a binary word. St001381The fertility of a permutation. St001402The number of separators in a permutation. St001403The number of vertical separators in a permutation. St001513The number of nested exceedences of a permutation. St001537The number of cyclic crossings of a permutation. St001550The number of inversions between exceedances where the greater exceedance is linked. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001715The number of non-records in a permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001847The number of occurrences of the pattern 1432 in a permutation. St001850The number of Hecke atoms of a permutation. St001851The number of Hecke atoms of a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St001903The number of fixed points of a parking function. St001472The permanent of the Coxeter matrix of the poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000907The number of maximal antichains of minimal length in a poset. St000939The number of characters of the symmetric group whose value on the partition is positive. St000993The multiplicity of the largest part of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000524The number of posets with the same order polynomial. St000717The number of ordinal summands of a poset. St000782The indicator function of whether a given perfect matching is an L & P matching. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000477The weight of a partition according to Alladi. St000668The least common multiple of the parts of the partition. St000675The number of centered multitunnels of a Dyck path. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000762The sum of the positions of the weak records of an integer composition. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St001118The acyclic chromatic index of a graph. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St000102The charge of a semistandard tableau.
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!