searching the database
Your data matches 54 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: St001192
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001192: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001192: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> 1
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 1
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
([(4,5)],6)
=> [1]
=> [1,0,1,0]
=> 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
Description
The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$.
Matching statistic: St001021
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001021: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001021: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
([(4,5)],6)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1 = 2 - 1
Description
Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001089
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001089: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001089: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
([(4,5)],6)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1 = 2 - 1
Description
Number 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.
Matching statistic: St001229
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001229: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001229: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0 = 1 - 1
([(4,5)],6)
=> [1]
=> [1,0,1,0]
=> 0 = 1 - 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> 0 = 1 - 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1 = 2 - 1
Description
The vector space dimension of the first extension group between the Jacobson radical J and J^2.
The vector space dimension of $Ext_A^1(J,J^2)$.
Matching statistic: St001194
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St001194: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St001194: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
([(4,5)],6)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
Description
The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module
Matching statistic: St001418
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001418: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001418: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
([(4,5)],6)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
Description
Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path.
The stable Auslander algebra is by definition the stable endomorphism ring of the direct sum of all indecomposable modules.
Matching statistic: St001431
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001431: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001431: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
([(4,5)],6)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
Description
Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path.
The modified algebra B is obtained from the stable Auslander algebra kQ/I by deleting all relations which contain walks of length at least three (conjectural this step of deletion is not necessary as the stable higher Auslander algebras might be quadratic) and taking as B then the algebra kQ^(op)/J when J is the quadratic perp of the ideal I.
See http://www.findstat.org/DyckPaths/NakayamaAlgebras for the definition of Loewy length and Nakayama algebras associated to Dyck paths.
Matching statistic: St000052
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2 = 3 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(4,5)],6)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 2 - 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2 = 3 - 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 2 - 1
Description
The number of valleys of a Dyck path not on the x-axis.
That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.
Matching statistic: St001033
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001033: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001033: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2 = 3 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0 = 1 - 1
([(4,5)],6)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2 = 3 - 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
Description
The normalized area of the parallelogram polyomino associated with the Dyck path.
The area of the smallest parallelogram polyomino equals the semilength of the Dyck path. This statistic is therefore the area of the parallelogram polyomino minus the semilength of the Dyck path.
The area itself is equidistributed with [[St001034]] and with [[St000395]].
Matching statistic: St001239
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00028: Dyck paths —reverse⟶ Dyck paths
St001239: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00028: Dyck paths —reverse⟶ Dyck paths
St001239: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
([(4,5)],6)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 2 = 1 + 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3 = 2 + 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3 = 2 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
Description
The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra.
The following 44 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001722The number of minimal chains with small intervals between a binary word and the top element. St000068The number of minimal elements in a poset. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001820The size of the image of the pop stack sorting operator. St001846The number of elements which do not have a complement in the lattice. St001720The minimal length of a chain of small intervals in a lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001621The number of atoms of a lattice. 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. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000181The number of connected components of the Hasse diagram for the poset. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000907The number of maximal antichains of minimal length in a poset. St001095The number of non-isomorphic posets with precisely one further covering relation. St001301The first Betti number of the order complex associated with the poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000553The number of blocks of a graph. St000775The multiplicity of the largest eigenvalue in a graph. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001739The number of graphs with the same edge polytope as the given graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St000258The burning number of a graph. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000449The number of pairs of vertices of a graph with distance 4. St000552The number of cut vertices of a graph. St001793The difference between the clique number and the chromatic number of a graph. St001826The maximal number of leaves on a vertex of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St000264The girth of a graph, which is not a tree.
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!