searching the database
Your data matches 757 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: St001122
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
St001122: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> 0 = 1 - 1
[1,1]
=> 0 = 1 - 1
[3]
=> 0 = 1 - 1
[2,1]
=> 1 = 2 - 1
[1,1,1]
=> 0 = 1 - 1
[4]
=> 0 = 1 - 1
[3,1]
=> 0 = 1 - 1
[2,2]
=> 1 = 2 - 1
[2,1,1]
=> 0 = 1 - 1
[1,1,1,1]
=> 0 = 1 - 1
[5]
=> 0 = 1 - 1
[4,1]
=> 0 = 1 - 1
[3,2]
=> 0 = 1 - 1
[3,1,1]
=> 1 = 2 - 1
[2,2,1]
=> 0 = 1 - 1
[2,1,1,1]
=> 0 = 1 - 1
[1,1,1,1,1]
=> 0 = 1 - 1
[6]
=> 0 = 1 - 1
[5,1]
=> 0 = 1 - 1
[4,2]
=> 0 = 1 - 1
[4,1,1]
=> 0 = 1 - 1
[3,3]
=> 0 = 1 - 1
[3,2,1]
=> 1 = 2 - 1
[3,1,1,1]
=> 0 = 1 - 1
[2,2,2]
=> 0 = 1 - 1
[2,2,1,1]
=> 0 = 1 - 1
[2,1,1,1,1]
=> 0 = 1 - 1
[1,1,1,1,1,1]
=> 0 = 1 - 1
Description
The multiplicity of the sign representation in the Kronecker square corresponding to a partition.
The Kronecker coefficient is the multiplicity gλμ,ν of the Specht module Sλ in Sμ⊗Sν:
Sμ⊗Sν=⨁λgλμ,νSλ
This statistic records the Kronecker coefficient g1nλ,λ, for λ⊢n. It equals 1 if and only if λ is self-conjugate.
Matching statistic: St000633
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00179: Integer partitions —to skew partition⟶ Skew partitions
Mp00185: Skew partitions —cell poset⟶ Posets
St000633: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00185: Skew partitions —cell poset⟶ Posets
St000633: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [[2],[]]
=> ([(0,1)],2)
=> 1
[1,1]
=> [[1,1],[]]
=> ([(0,1)],2)
=> 1
[3]
=> [[3],[]]
=> ([(0,2),(2,1)],3)
=> 1
[2,1]
=> [[2,1],[]]
=> ([(0,1),(0,2)],3)
=> 2
[1,1,1]
=> [[1,1,1],[]]
=> ([(0,2),(2,1)],3)
=> 1
[4]
=> [[4],[]]
=> ([(0,3),(2,1),(3,2)],4)
=> 1
[3,1]
=> [[3,1],[]]
=> ([(0,2),(0,3),(3,1)],4)
=> 1
[2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[2,1,1]
=> [[2,1,1],[]]
=> ([(0,2),(0,3),(3,1)],4)
=> 1
[1,1,1,1]
=> [[1,1,1,1],[]]
=> ([(0,3),(2,1),(3,2)],4)
=> 1
[5]
=> [[5],[]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
[4,1]
=> [[4,1],[]]
=> ([(0,2),(0,4),(3,1),(4,3)],5)
=> 1
[3,2]
=> [[3,2],[]]
=> ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> 1
[3,1,1]
=> [[3,1,1],[]]
=> ([(0,3),(0,4),(3,2),(4,1)],5)
=> 2
[2,2,1]
=> [[2,2,1],[]]
=> ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> 1
[2,1,1,1]
=> [[2,1,1,1],[]]
=> ([(0,2),(0,4),(3,1),(4,3)],5)
=> 1
[1,1,1,1,1]
=> [[1,1,1,1,1],[]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
[6]
=> [[6],[]]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 1
[5,1]
=> [[5,1],[]]
=> ([(0,2),(0,5),(3,4),(4,1),(5,3)],6)
=> 1
[4,2]
=> [[4,2],[]]
=> ([(0,2),(0,4),(2,5),(3,1),(4,3),(4,5)],6)
=> 1
[4,1,1]
=> [[4,1,1],[]]
=> ([(0,4),(0,5),(3,2),(4,3),(5,1)],6)
=> 1
[3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 1
[3,2,1]
=> [[3,2,1],[]]
=> ([(0,3),(0,4),(3,2),(3,5),(4,1),(4,5)],6)
=> 2
[3,1,1,1]
=> [[3,1,1,1],[]]
=> ([(0,4),(0,5),(3,2),(4,3),(5,1)],6)
=> 1
[2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 1
[2,2,1,1]
=> [[2,2,1,1],[]]
=> ([(0,2),(0,4),(2,5),(3,1),(4,3),(4,5)],6)
=> 1
[2,1,1,1,1]
=> [[2,1,1,1,1],[]]
=> ([(0,2),(0,5),(3,4),(4,1),(5,3)],6)
=> 1
[1,1,1,1,1,1]
=> [[1,1,1,1,1,1],[]]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 1
Description
The size of the automorphism group of a poset.
A poset automorphism is a permutation of the elements of the poset preserving the order relation.
Matching statistic: St001399
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00179: Integer partitions —to skew partition⟶ Skew partitions
Mp00185: Skew partitions —cell poset⟶ Posets
St001399: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00185: Skew partitions —cell poset⟶ Posets
St001399: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [[2],[]]
=> ([(0,1)],2)
=> 1
[1,1]
=> [[1,1],[]]
=> ([(0,1)],2)
=> 1
[3]
=> [[3],[]]
=> ([(0,2),(2,1)],3)
=> 1
[2,1]
=> [[2,1],[]]
=> ([(0,1),(0,2)],3)
=> 2
[1,1,1]
=> [[1,1,1],[]]
=> ([(0,2),(2,1)],3)
=> 1
[4]
=> [[4],[]]
=> ([(0,3),(2,1),(3,2)],4)
=> 1
[3,1]
=> [[3,1],[]]
=> ([(0,2),(0,3),(3,1)],4)
=> 1
[2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[2,1,1]
=> [[2,1,1],[]]
=> ([(0,2),(0,3),(3,1)],4)
=> 1
[1,1,1,1]
=> [[1,1,1,1],[]]
=> ([(0,3),(2,1),(3,2)],4)
=> 1
[5]
=> [[5],[]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
[4,1]
=> [[4,1],[]]
=> ([(0,2),(0,4),(3,1),(4,3)],5)
=> 1
[3,2]
=> [[3,2],[]]
=> ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> 1
[3,1,1]
=> [[3,1,1],[]]
=> ([(0,3),(0,4),(3,2),(4,1)],5)
=> 2
[2,2,1]
=> [[2,2,1],[]]
=> ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> 1
[2,1,1,1]
=> [[2,1,1,1],[]]
=> ([(0,2),(0,4),(3,1),(4,3)],5)
=> 1
[1,1,1,1,1]
=> [[1,1,1,1,1],[]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
[6]
=> [[6],[]]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 1
[5,1]
=> [[5,1],[]]
=> ([(0,2),(0,5),(3,4),(4,1),(5,3)],6)
=> 1
[4,2]
=> [[4,2],[]]
=> ([(0,2),(0,4),(2,5),(3,1),(4,3),(4,5)],6)
=> 1
[4,1,1]
=> [[4,1,1],[]]
=> ([(0,4),(0,5),(3,2),(4,3),(5,1)],6)
=> 1
[3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 1
[3,2,1]
=> [[3,2,1],[]]
=> ([(0,3),(0,4),(3,2),(3,5),(4,1),(4,5)],6)
=> 2
[3,1,1,1]
=> [[3,1,1,1],[]]
=> ([(0,4),(0,5),(3,2),(4,3),(5,1)],6)
=> 1
[2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 1
[2,2,1,1]
=> [[2,2,1,1],[]]
=> ([(0,2),(0,4),(2,5),(3,1),(4,3),(4,5)],6)
=> 1
[2,1,1,1,1]
=> [[2,1,1,1,1],[]]
=> ([(0,2),(0,5),(3,4),(4,1),(5,3)],6)
=> 1
[1,1,1,1,1,1]
=> [[1,1,1,1,1,1],[]]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 1
Description
The distinguishing number of a poset.
This is the minimal number of colours needed to colour the vertices of a poset, such that only the trivial automorphism of the poset preserves the colouring.
See also [[St000469]], which is the same concept for graphs.
Matching statistic: St001141
(load all 33 compositions to match this statistic)
(load all 33 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
St001141: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
St001141: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 0 = 1 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 0 = 1 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 0 = 1 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 0 = 1 - 1
Description
The number of occurrences of hills of size 3 in a Dyck path.
A hill of size three is a subpath beginning at height zero, consisting of three up steps followed by three down steps.
Matching statistic: St001172
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00123: Dyck paths —Barnabei-Castronuovo involution⟶ Dyck paths
St001172: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00123: Dyck paths —Barnabei-Castronuovo involution⟶ Dyck paths
St001172: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[2,1]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 0 = 1 - 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0 = 1 - 1
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> 0 = 1 - 1
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0 = 1 - 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 0 = 1 - 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0 = 1 - 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 1 = 2 - 1
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 0 = 1 - 1
Description
The number of 1-rises at odd height of a Dyck path.
Matching statistic: St001181
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001181: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001181: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [1,0,1,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [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]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
Description
Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra.
Matching statistic: St001221
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
St001221: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
St001221: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [1,0,1,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 0 = 1 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 0 = 1 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 0 = 1 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 0 = 1 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
Description
The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module.
Matching statistic: St001263
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00100: Dyck paths —touch composition⟶ Integer compositions
St001263: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00100: Dyck paths —touch composition⟶ Integer compositions
St001263: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [1,1,0,0,1,0]
=> [2,1] => 0 = 1 - 1
[1,1]
=> [1,0,1,1,0,0]
=> [1,2] => 0 = 1 - 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => 0 = 1 - 1
[2,1]
=> [1,0,1,0,1,0]
=> [1,1,1] => 1 = 2 - 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => 0 = 1 - 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => 0 = 1 - 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [3,1] => 0 = 1 - 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => 1 = 2 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3] => 0 = 1 - 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 0 = 1 - 1
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5,1] => 0 = 1 - 1
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1] => 0 = 1 - 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => 0 = 1 - 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => 1 = 2 - 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => 0 = 1 - 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,4] => 0 = 1 - 1
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,5] => 0 = 1 - 1
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [6,1] => 0 = 1 - 1
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [5,1] => 0 = 1 - 1
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [4,1] => 0 = 1 - 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,1] => 0 = 1 - 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => 0 = 1 - 1
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1 = 2 - 1
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4] => 0 = 1 - 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 0 = 1 - 1
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,4] => 0 = 1 - 1
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,5] => 0 = 1 - 1
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,6] => 0 = 1 - 1
Description
The index of the maximal parabolic seaweed algebra associated with the composition.
Let a1,…,am and b1,…,bt be a pair of compositions of n. The meander associated to this pair is obtained as follows:
* place n dots on a horizontal line
* subdivide the dots into m blocks of sizes a1,a2,…
* within each block, connect the first and the last dot, the second and the next to last, and so on, with an arc above the line
* subdivide the dots into t blocks of sizes b1,b2,…
* within each block, connect the first and the last dot, the second and the next to last, and so on, with an arc below the line
By [1, thm.5.1], the index of the seaweed algebra associated to the pair of compositions is
indb1|b2|...|bta1|a2|...|am=2C+P−1,
where C is the number of cycles (of length at least 2) and P is the number of paths in the meander.
This statistic is indb1|b2|...|btn.
Matching statistic: St001663
(load all 41 compositions to match this statistic)
(load all 41 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St001663: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St001663: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [1,0,1,0]
=> [1,2] => 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [2,1] => 0 = 1 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => 1 = 2 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [2,3,1] => 0 = 1 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 1 = 2 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [3,2,1] => 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 0 = 1 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0 = 1 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 1 = 2 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 0 = 1 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 0 = 1 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 0 = 1 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 0 = 1 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 0 = 1 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => 1 = 2 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 0 = 1 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => 0 = 1 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 0 = 1 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 0 = 1 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => 0 = 1 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 0 = 1 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 0 = 1 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => 0 = 1 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => 0 = 1 - 1
Description
The number of occurrences of the Hertzsprung pattern 132 in a permutation.
A Hertzsprung occurrence of the pattern τ=(τ1,…,τk) in a permutation π is a factor πi,πi+1,…,πi+k−1 of π such that πi+j−1−τj is constant for 1≤j≤k.
Matching statistic: St000655
(load all 16 compositions to match this statistic)
(load all 16 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
St000655: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
St000655: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,1]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> 2
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 1
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> 2
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 1
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> 1
Description
The length of the minimal rise of a Dyck path.
For the length of a maximal rise, see [[St000444]].
The following 747 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000657The smallest part of an integer composition. St000669The number of permutations obtained by switching ascents or descents of size 2. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000701The protection number of a binary tree. St000764The number of strong records in an integer composition. 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. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000366The number of double descents of a permutation. St000367The number of simsun double descents of a permutation. St000534The number of 2-rises of a permutation. St000552The number of cut vertices of a graph. St000663The number of right floats of a permutation. St000761The number of ascents in an integer composition. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. 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. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001139The number of occurrences of hills of size 2 in a Dyck path. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001402The number of separators in a permutation. St001403The number of vertical separators in a permutation. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001850The number of Hecke atoms of a permutation. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000667The greatest common divisor of the parts of the partition. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) [c0,c1,...,cn−1] by adding c0 to cn−1. St001006Number of simple modules with projective dimension equal to the global dimension of 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. St001162The minimum jump of a permutation. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001481The minimal height of a peak of a Dyck path. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001665The number of pure excedances of a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000122The number of occurrences of the contiguous pattern [.,[.,[[.,.],.]]] in a binary tree. St000649The number of 3-excedences of a permutation. St000650The number of 3-rises of a permutation. St000954Number of times the corresponding LNakayama algebra has Exti(D(A),A)=0 for i>0. St001061The number of indices that are both descents and recoils of a permutation. 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. St001549The number of restricted non-inversions between exceedances. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001705The number of occurrences of the pattern 2413 in a permutation. St000352The Elizalde-Pak rank of a permutation. St000781The number of proper colouring schemes of a Ferrers diagram. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000003The number of standard Young tableaux of the partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000182The number of permutations whose cycle type is the given integer partition. St000183The side length of the Durfee square of an integer partition. St000275Number of permutations whose sorted list of non zero multiplicities of the Lehmer code is the given partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000321The number of integer partitions of n that are dominated by an integer partition. St000326The position of the first one in a binary word after appending a 1 at the end. St000345The number of refinements of a partition. St000517The Kreweras number of an integer partition. St000627The exponent of a binary word. St000628The balance of a binary word. St000847The number of standard Young tableaux whose descent set is the binary word. St000897The number of different multiplicities of parts of an integer partition. St000913The number of ways to refine the partition into singletons. St000935The number of ordered refinements of an integer partition. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is 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. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001188The number of simple modules S with grade inf 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. St001196The global dimension of A minus the global dimension of eAe for the corresponding Nakayama algebra 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. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. 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. St001256Number of simple reflexive modules that are 2-stable reflexive. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 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. St001597The Frobenius rank of a skew partition. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. 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. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000047The number of standard immaculate tableaux of a given shape. St000048The multinomial of the parts of a partition. St000053The number of valleys of the Dyck path. St000056The decomposition (or block) number of a permutation. St000068The number of minimal elements in a poset. St000079The number of alternating sign matrices for a given Dyck path. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000115The single entry in the last row. St000124The cardinality of the preimage of the Simion-Schmidt map. St000141The maximum drop size of a permutation. St000154The sum of the descent bottoms of a permutation. St000181The number of connected components of the Hasse diagram for the poset. St000201The number of leaf nodes in a binary tree. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000234The number of global ascents of a permutation. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000255The number of reduced Kogan faces with the permutation as type. St000277The number of ribbon shaped standard tableaux. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000306The bounce count of a Dyck path. St000316The number of non-left-to-right-maxima of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000340The number of non-final maximal constant sub-paths of length greater than one. St000346The number of coarsenings of a partition. St000354The number of recoils of a permutation. St000390The number of runs of ones in a binary word. 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. St000487The length of the shortest cycle of a permutation. St000529The number of permutations whose descent word is the given binary word. St000539The number of odd inversions 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. St000543The size of the conjugacy class of a binary word. St000570The Edelman-Greene number of a permutation. St000626The minimal period of a binary word. St000630The length of the shortest palindromic decomposition of a binary word. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St000679The pruning number of an ordered tree. St000691The number of changes of a binary word. St000694The number of affine bounded permutations that project to a given permutation. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000700The protection number of an ordered tree. St000705The number of semistandard tableaux on a given integer partition of n with maximal entry n. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. 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. St000763The sum of the positions of the strong records of an integer composition. St000765The number of weak records in an integer composition. St000767The number of runs in an integer composition. St000788The number of nesting-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. St000816The number of standard composition tableaux of the composition. St000820The number of compositions obtained by rotating the composition. St000829The Ulam distance of a permutation to the identity permutation. St000862The number of parts of the shifted shape of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000876The number of factors in the Catalan decomposition of a binary word. St000877The depth of the binary word interpreted as a path. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000886The number of permutations with the same antidiagonal sums. St000889The number of alternating sign matrices with the same antidiagonal sums. St000903The number of different parts of an integer composition. St000905The number of different multiplicities of parts of an integer composition. St000908The length of the shortest maximal antichain in a poset. St000919The number of maximal left branches of a binary tree. St000920The logarithmic height of a Dyck path. St000955Number of times one has Ext^i(D(A),A)>0 for i>0 for the corresponding LNakayama algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000983The length of the longest alternating subword. St000993The multiplicity of the largest part of an integer partition. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001075The minimal size of a block of a set partition. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. 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. St001129The product of the squares of the parts of a partition. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. 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. St001194The injective dimension of A/AfA in the corresponding Nakayama algebra A when Af is the minimal faithful projective-injective left A-module St001197The global dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001205The number of non-simple indecomposable projective-injective modules of the algebra eAe in the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. 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). St001220The width of a permutation. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001267The length of the Lyndon factorization of the binary word. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. 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. St001313The number of Dyck paths above the lattice path given by a binary word. St001344The neighbouring number of a permutation. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. 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. St001437The flex of a binary word. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001489The maximum of the number of descents and the number of inverse descents. St001498The normalised height of a Nakayama algebra with magnitude 1. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001590The crossing number of a perfect matching. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001675The number of parts equal to the part in the reversed composition. St001729The number of visible descents of a permutation. St001732The number of peaks visible from the left. St001735The number of permutations with the same set of runs. St001737The number of descents of type 2 in a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between e_i J and e_j J (the radical of the indecomposable projective modules). St001874Lusztig's a-function for the symmetric group. St001884The number of borders of a binary word. St001928The number of non-overlapping descents in a permutation. St001933The largest multiplicity of a part in an integer partition. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000666The number of right tethers of a permutation. St000353The number of inner valleys of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000711The number of big exceedences of a permutation. St000732The number of double deficiencies of a permutation. St001081The number of minimal length factorizations of a permutation into star transpositions. St001132The number of leaves in the subtree whose sister has label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. 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). 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. St001568The smallest positive integer that does not appear twice in the partition. St001569The maximal modular displacement of a permutation. St000237The number of small exceedances. St000488The number of cycles of a permutation of length at most 2. St000542The number of left-to-right-minima of a permutation. St000664The number of right ropes of a permutation. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001571The Cartan determinant of the integer partition. St001195The global dimension of the algebra A/AfA of the corresponding Nakayama algebra A with minimal left faithful projective-injective module Af. St001964The interval resolution global dimension of a poset. St000260The radius of a connected graph. St000640The rank of the largest boolean interval in a poset. St000706The product of the factorials of the multiplicities of an integer partition. St000735The last entry on the main diagonal of a standard tableau. St000741The Colin de Verdière graph invariant. St000762The sum of the positions of the weak records of an integer composition. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000914The sum of the values of the Möbius function of a poset. St000988The orbit size of a permutation under Foata's bijection. St001052The length of the exterior of a permutation. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001890The maximum magnitude of the Möbius function of a poset. St001095The number of non-isomorphic posets with precisely one further covering relation. St001557The number of inversions of the second entry of a permutation. St001432The order dimension of the partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001820The size of the image of the pop stack sorting operator. St001615The number of join prime elements of a lattice. St001846The number of elements which do not have a complement in the lattice. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000618The number of self-evacuating tableaux of given shape. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001389The number of partitions of the same length below the given integer partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001924The number of cells in an integer partition whose arm and leg length coincide. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000026The position of the first return of a Dyck path. St000075The orbit size of a standard tableau under promotion. St000120The number of left tunnels of a Dyck path. St000147The largest part of an integer partition. St000159The number of distinct parts of the integer partition. St000160The multiplicity of the smallest part of a partition. St000378The diagonal inversion number of an integer partition. St000454The largest eigenvalue of a graph if it is integral. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000734The last entry in the first row of a standard tableau. St000783The side length of the largest staircase partition fitting into a partition. St000947The major index east count of a Dyck path. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001161The major index north count of a Dyck path. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001274The number of indecomposable injective modules with projective dimension equal to two. St001278The number of indecomposable modules that are fixed by \tau \Omega^1 composed with its inverse in the corresponding Nakayama algebra. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001462The number of factors of a standard tableaux under concatenation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001595The number of standard Young tableaux of the skew partition. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001838The number of nonempty primitive factors of a binary word. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St000455The second largest eigenvalue of a graph if it is integral. St000768The number of peaks in an integer composition. St001330The hat guessing number of a graph. St001527The cyclic permutation representation number of an integer partition. St001435The number of missing boxes in the first row. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St001128The exponens consonantiae of a partition. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001520The number of strict 3-descents. St001556The number of inversions of the third entry of a permutation. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St000297The number of leading ones in a binary word. St000392The length of the longest run of ones in a binary word. St000982The length of the longest constant subword. 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. St001423The number of distinct cubes in a binary word. St001730The number of times the path corresponding to a binary word crosses the base line. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001851The number of Hecke atoms of a signed permutation. St001372The length of a longest cyclic run of ones of a binary word. St000045The number of linear extensions of a binary tree. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001763The Hurwitz number of an integer partition. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St000456The monochromatic index of a connected graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000782The indicator function of whether a given perfect matching is an L & P matching. St000451The length of the longest pattern of the form k 1 2. St000842The breadth of a permutation. St000284The Plancherel distribution on integer partitions. St000668The least common multiple of the parts of the partition. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. 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. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000933The number of multipartitions of sizes given by an integer partition. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St000818The sum of the entries in the column specified by the composition of the change of basis matrix from quasisymmetric Schur functions to monomial quasisymmetric functions. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. 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. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St000058The order of a permutation. St000254The nesting number of a set partition. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000929The constant term of the character polynomial of an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St001896The number of right descents of a signed permutations. St001935The number of ascents in a parking function. St000090The variation of a composition. St000091The descent variation of a composition. St000217The number of occurrences of the pattern 312 in a permutation. St000233The number of nestings of a set partition. St000338The number of pixed points of a permutation. St000358The number of occurrences of the pattern 31-2. St000365The number of double ascents of a permutation. St000527The width of the poset. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000709The number of occurrences of 14-2-3 or 14-3-2. St000779The tier of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. 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). St001438The number of missing boxes of a skew partition. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001741The largest integer such that all patterns of this size are contained in the permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001811The Castelnuovo-Mumford regularity of 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. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000259The diameter of a connected graph. St001632The number of indecomposable injective modules I with dim Ext^1(I,A)=1 for the incidence algebra A of a poset. St000022The number of fixed points of a permutation. St000245The number of ascents of a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length 3. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000546The number of global descents of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000731The number of double exceedences of a permutation. St001488The number of corners of a skew partition. St001623The number of doubly irreducible elements of a lattice. St001624The breadth of a lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001713The difference of the first and last value in the first row of the Gelfand-Tsetlin pattern. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000670The reversal length of a permutation. St000703The number of deficiencies of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001875The number of simple modules with projective dimension at most 1. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000681The Grundy value of Chomp on Ferrers diagrams. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001625The Möbius invariant of a lattice. St001621The number of atoms of a lattice. St001626The number of maximal proper sublattices of a lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. 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). St000021The number of descents of a permutation. St000023The number of inner peaks of a permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000210Minimum over maximum difference of elements in cycles. St000253The crossing number of a set partition. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000563The number of overlapping pairs of blocks 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. St000596The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1 is maximal. St000601The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, (2,3) are consecutive in a block. St000646The number of big ascents of a permutation. St000654The first descent of a permutation. St000729The minimal arc length of a set partition. St000872The number of very big descents of a permutation. St000925The number of topologically connected components of a set partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000990The first ascent of a permutation. St001114The number of odd descents of a permutation. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001388The number of non-attacking neighbors of a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001461The number of topologically connected components of the chord diagram of a permutation. St001469The holeyness of a permutation. St001470The cyclic holeyness of a permutation. St001565The number of arithmetic progressions of length 2 in a permutation. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001652The length of a longest interval of consecutive numbers. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001662The length of the longest factor of consecutive numbers in a permutation. St001712The number of natural descents of a standard Young tableau. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 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. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St001889The size of the connectivity set of a signed permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000039The number of crossings of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000084The number of subtrees. St000105The number of blocks in the set partition. St000133The "bounce" of a permutation. St000168The number of internal nodes of an ordered tree. 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. St000219The number of occurrences of the pattern 231 in a permutation. St000221The number of strong fixed points of a permutation. St000222The number of alignments in the permutation. St000236The number of cyclical small weak excedances. St000239The number of small weak excedances. St000241The number of cyclical small excedances. St000247The number of singleton blocks of a set partition. St000248The number of anti-singletons of a set partition. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St000251The number of nonsingleton blocks of a set partition. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000295The length of the border of a binary word. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000317The cycle descent number of a permutation. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000355The number of occurrences of the pattern 21-3. 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. 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. St000470The number of runs in a permutation. St000485The length of the longest cycle of a permutation. St000496The rcs statistic of a set partition. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000502The number of successions of a set partitions. St000504The cardinality of the first block of a set partition. 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. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000561The number of occurrences of the pattern {{1,2,3}} in a set partition. St000573The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton and 2 a maximal element. St000574The number of occurrences of the pattern {{1},{2}} such that 1 is a minimal 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. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. 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. St000589The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal, (2,3) are consecutive in a block. 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. 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. 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. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are 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. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St000609The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000611The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal. St000615The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are maximal. St000619The number of cyclic descents of a permutation. St000623The number of occurrences of the pattern 52341 in a permutation. St000624The normalized sum of the minimal distances to a greater element. 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. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000836The number of descents of distance 2 of a permutation. St000837The number of ascents of distance 2 of a permutation. St000850The number of 1/2-balanced pairs in a poset. St000879The number of long braid edges in the graph of braid moves of a permutation. St000943The number of spots the most unlucky car had to go further in a parking function. St000961The shifted major index of a permutation. St000962The 3-shifted major index of a permutation. St000963The 2-shifted major index of a permutation. St000989The number of final rises of a permutation. St000991The number of right-to-left minima of a permutation. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001062The maximal size of a block of a set partition. St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. St001082The number of boxed occurrences of 123 in a permutation. St001130The number of two successive successions in a permutation. St001151The number of blocks with odd minimum. 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. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. 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. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001396Number of triples of incomparable elements in a finite poset. St001513The number of nested exceedences of a permutation. St001535The number of cyclic alignments of a permutation. St001537The number of cyclic crossings of a permutation. St001550The number of inversions between exceedances where the greater exceedance is linked. St001552The number of inversions between excedances and fixed points of a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001715The number of non-records in a permutation. St001728The number of invisible descents of a permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001841The number of inversions of a set partition. St001847The number of occurrences of the pattern 1432 in a 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. St001905The number of preferred parking spots in a parking function less than the index of the car. St001911A descent variant minus the number of inversions. St000004The major index of a permutation. St000037The sign of a permutation. St000080The rank of the poset. St000136The dinv of a parking function. St000155The number of exceedances (also excedences) of a permutation. St000166The depth minus 1 of an ordered tree. St000194The number of primary dinversion pairs of a labelled dyck path corresponding to a parking function. St000211The rank of the set partition. St000213The number of weak exceedances (also weak excedences) of a permutation. St000216The absolute length of a permutation. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000339The maf index of a permutation. St000429The number of occurrences of the pattern 123 or of the pattern 321 in a permutation. St000461The rix statistic of a permutation. St000489The number of cycles of a permutation of length at most 3. St000493The los statistic of a set partition. St000495The number of inversions of distance at most 2 of a permutation. St000499The rcb statistic of a set partition. St000558The number of occurrences of the pattern {{1,2}} in a set partition. St000572The dimension exponent of a set partition. St000595The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal. St000612The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, (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. St000638The number of up-down runs of a permutation. St000653The last descent of a permutation. St000702The number of weak deficiencies of a permutation. St000747A variant of the major index of a set partition. St000748The major index of the permutation obtained by flattening the set partition. St000794The mak of a permutation. St000798The makl of a permutation. St000809The reduced reflection length of the permutation. St000823The number of unsplittable factors of the 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. St000833The comajor index of a permutation. St000873The aix statistic of a permutation. St000956The maximal displacement of a permutation. St001285The number of primes in the column sums of the two line notation of a permutation. St001298The number of repeated entries in the Lehmer code of a permutation. St001405The number of bonds in a permutation. St001424The number of distinct squares in a binary word. St001472The permanent of the Coxeter matrix of the poset. St001497The position of the largest weak excedence of a permutation. St001517The length of a longest pair of twins in a permutation. St001566The length of the longest arithmetic progression in a permutation. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001667The maximal size of a pair of weak twins for a permutation. St001731The factorization defect of a permutation. St001760The number of prefix or suffix reversals needed to sort a permutation. St001769The reflection length of a signed permutation. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001778The largest greatest common divisor of an element and its image in a permutation. St001861The number of Bruhat lower covers of a permutation. St001894The depth of a signed permutation. St001926Sparre Andersen's position of the maximum of a signed permutation. St000116The major index of a semistandard tableau obtained by standardizing. St000135The number of lucky cars of the parking function. St000503The maximal difference between two elements in a common block. St000519The largest length of a factor maximising the subword complexity. St000677The standardized bi-alternating inversion number of a permutation. St000744The length of the path to the largest entry in a standard Young tableau. St000863The length of the first row of the shifted shape of a permutation. St000906The length of the shortest maximal chain in a poset. St000922The minimal number such that all substrings of this length are unique. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St001288The number of primes obtained by multiplying preimage and image of a permutation and adding one. St001375The pancake length of a permutation. St001439The number of even weak deficiencies and of odd weak exceedences. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001927Sparre Andersen's number of positives of a signed permutation. St000030The sum of the descent differences of a permutations. St000044The number of vertices of the unicellular map given by a perfect matching. St000060The greater neighbor of the maximum. St000250The number of blocks (St000105) plus the number of antisingletons (St000248) of a set partition. St000304The load of a permutation. St000492The rob statistic of a set partition. St000554The number of occurrences of the pattern {{1,2},{3}} in a set partition. St000556The number of occurrences of the pattern {{1},{2,3}} in a set partition. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. St000586The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal. St000597The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, (2,3) are consecutive in a block. St000599The number of occurrences of the pattern {{1},{2,3}} such that (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. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000643The size of the largest orbit of antichains under Panyushev complementation. St000680The Grundy value for Hackendot on posets. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001077The prefix exchange distance of a permutation. St001160The number of proper blocks (or intervals) of a permutations. St001245The cyclic maximal difference between two consecutive entries of a permutation. St001246The maximal difference between two consecutive entries of a permutation. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001718The number of non-empty open intervals in a poset. St001782The order of rowmotion on the set of order ideals of a poset. St001848The atomic length of a signed permutation. St001958The degree of the polynomial interpolating the values of a permutation. St000017The number of inversions of a standard tableau. St000064The number of one-box pattern of a permutation. St000111The sum of the descent tops (or Genocchi descents) of a permutation. St000156The Denert index of a permutation. St000494The number of inversions of distance at most 3 of a permutation. St000501The size of the first part in the decomposition of a permutation. St000540The sum of the entries of a parking function minus its length. St000673The number of non-fixed points of a permutation. St000756The sum of the positions of the left to right maxima of a permutation. St000844The size of the largest block in the direct sum decomposition of a permutation. St001377The major index minus the number of inversions of a permutation. St001519The pinnacle sum of a permutation. St001536The number of cyclic misalignments of a permutation. St001807The lower middle entry of a permutation. St000728The dimension of a set partition. St000795The mad of a permutation. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001468The smallest fixpoint of a permutation. St001721The degree of a binary word. St000008The major index of the composition. St000230Sum of the minimal elements of the blocks of a set partition. St000305The inverse major index of a permutation. St000415The size of the automorphism group of the rooted tree underlying the ordered tree. St000625The sum of the minimal distances to a greater element. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001671Haglund's hag of a permutation. St000229Sum of the difference between the maximal and the minimal elements of the blocks plus the number of blocks of a set partition. St000564The number of occurrences of the pattern {{1},{2}} in a set partition. St000797The stat`` of a permutation. St001759The Rajchgot index of a permutation. St000165The sum of the entries of a parking function. St001858The number of covering elements of a signed permutation in absolute order. St001865The number of alignments of a signed permutation. St000391The sum of the positions of the ones in a binary word. St001412Number of minimal entries in the Bruhat order matrix of a permutation. St001684The reduced word complexity of a permutation. St000690The size of the conjugacy class of a permutation. St000016The number of attacking pairs of a standard tableau. St000530The number of permutations with the same descent word as the given permutation. St001770The number of facets of a certain subword complex associated with the signed permutation. St001168The vector space dimension of the tilting module corresponding to the permutation in the Auslander algebra of K[x]/(x^n). St001852The size of the conjugacy class of the signed permutation. St000280The size of the preimage of the map 'to labelling permutation' from Parking functions to Permutations. St001885The number of binary words with the same proper border set. St000324The shape of the tree associated to a permutation. St001528The number of permutations such that the product with the permutation has the same number of fixed points.
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!