searching the database
Your data matches 52 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: St000660
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000660: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000660: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,4),(2,3)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,5),(2,4),(3,4),(3,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
Description
The number of rises of length at least 3 of a Dyck path.
The number of Dyck paths without such rises are counted by the Motzkin numbers [1].
Matching statistic: St001159
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00028: Dyck paths —reverse⟶ Dyck paths
St001159: 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
St001159: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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]
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 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]
=> 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]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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]
=> 0
([(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]
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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]
=> 0
([(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]
=> 0
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,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,1,1,0,0,0,0,1,0]
=> 0
([(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]
=> 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]
=> 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]
=> 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]
=> 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]
=> 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]
=> 0
([(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]
=> 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]
=> 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]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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]
=> 0
([(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]
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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]
=> 0
([(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]
=> 0
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,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,1,1,0,0,0,0,1,0]
=> 0
([(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]
=> 0
([(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]
=> 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]
=> 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]
=> 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]
=> 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]
=> 0
([(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]
=> 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]
=> 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]
=> 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]
=> 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]
=> 1
([(0,5),(1,4),(2,3)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 0
([(1,5),(2,4),(3,4),(3,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]
=> 0
([(0,1),(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]
=> 0
([(1,2),(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]
=> 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 1
Description
Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra.
Matching statistic: St001195
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
St001195: 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
St001195: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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,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,1,0,0,1,0,0]
=> 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]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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
([(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,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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
([(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
([(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]
=> 0
([(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
([(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,1,0,1,0,0,1,0,0]
=> 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]
=> 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
([(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
([(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]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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,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
([(2,5),(3,4)],6)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
([(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,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
([(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]
=> 0
([(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
([(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
([(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,1,0,0,0]
=> 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]
=> 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,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]
=> 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]
=> 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
([(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
([(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
([(0,5),(1,4),(2,3)],6)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0
([(1,5),(2,4),(3,4),(3,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
([(0,1),(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,2),(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
([(1,4),(2,3),(2,5),(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
Description
The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$.
Matching statistic: St000920
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000920: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000920: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 0 + 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 2 = 1 + 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 0 + 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 0 + 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,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,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 0 + 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 0 + 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,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,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2 = 1 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,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,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,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,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 0 + 1
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 0 + 1
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,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,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,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,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 2 = 1 + 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,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,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2 = 1 + 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 2 = 1 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 2 = 1 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 2 = 1 + 1
([(0,5),(1,4),(2,3)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
([(0,1),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2 = 1 + 1
Description
The logarithmic height of a Dyck path.
This is the floor of the binary logarithm of the usual height increased by one:
$$
\lfloor\log_2(1+height(D))\rfloor
$$
Matching statistic: St001204
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001204: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001204: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> 0
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> 0
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> 0
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> 0
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> 0
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,4),(2,3)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(1,5),(2,4),(3,4),(3,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(0,1),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,6),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,6),(1,6),(2,5),(3,4),(3,6),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,5),(1,6),(2,3),(2,4),(3,6),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,6),(1,4),(2,5),(2,6),(3,5),(3,6),(4,5)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,4),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,5),(1,2),(1,3),(2,6),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,6),(1,6),(2,3),(2,4),(3,5),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,6),(1,4),(2,3),(2,6),(3,5),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
Description
Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra.
Associate to this special CNakayama algebra a Dyck path as follows:
In the list L delete the first entry $c_0$ and substract from all other entries $n$−1 and then append the last element 1. The result is a Kupisch series of an LNakayama algebra.
The statistic gives the $(t-1)/2$ when $t$ is the projective dimension of the simple module $S_{n-2}$.
Matching statistic: St001498
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001498: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001498: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> ? = 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> ? = 0
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> ? = 0
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> ? = 0
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> ? = 0
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> ? = 0
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> ? = 0
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,4),(2,3)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(1,5),(2,4),(3,4),(3,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(0,1),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> 0
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
([(0,1),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(4,6),(5,6)],7)
=> [1,1]
=> [1,1,0,0]
=> ? = 0
([(3,6),(4,5)],7)
=> [1,1]
=> [1,1,0,0]
=> ? = 0
Description
The normalised height of a Nakayama algebra with magnitude 1.
We use the bijection (see code) suggested by Christian Stump, to have a bijection between such Nakayama algebras with magnitude 1 and Dyck paths. The normalised height is the height of the (periodic) Dyck path given by the top of the Auslander-Reiten quiver. Thus when having a CNakayama algebra it is the Loewy length minus the number of simple modules and for the LNakayama algebras it is the usual height.
Matching statistic: St001089
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001089: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001089: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [1,1]
=> [2]
=> [1,0,1,0]
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [2]
=> [1,0,1,0]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [2]
=> [1,0,1,0]
=> 0
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [2]
=> [1,0,1,0]
=> 0
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [2]
=> [1,0,1,0]
=> 0
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [2]
=> [1,0,1,0]
=> 0
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [2]
=> [1,0,1,0]
=> 0
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
([(0,5),(1,4),(2,3)],6)
=> [1,1,1]
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(1,5),(2,4),(3,4),(3,5)],6)
=> [1,1,1,1]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,6),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,6),(1,6),(2,5),(3,4),(3,6),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,5),(1,6),(2,3),(2,4),(3,6),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,6),(1,4),(2,5),(2,6),(3,5),(3,6),(4,5)],7)
=> [4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,4),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,5),(1,2),(1,3),(2,6),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,6),(1,6),(2,3),(2,4),(3,5),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
([(0,6),(1,4),(2,3),(2,6),(3,5),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 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: St001217
(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
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001217: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001217: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,4),(2,3)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,5),(2,4),(3,4),(3,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,6),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,6),(1,6),(2,5),(3,4),(3,6),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,5),(1,6),(2,3),(2,4),(3,6),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,6),(1,4),(2,5),(2,6),(3,5),(3,6),(4,5)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,4),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,5),(1,2),(1,3),(2,6),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,6),(1,6),(2,3),(2,4),(3,5),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,6),(1,4),(2,3),(2,6),(3,5),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
Description
The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1.
Matching statistic: St001221
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001221: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001221: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 0
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,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,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 0
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,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,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,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,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 1
([(0,5),(1,4),(2,3)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 0
([(1,5),(2,4),(3,4),(3,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,1),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1
([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 1
([(0,6),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 1
([(0,6),(1,6),(2,5),(3,4),(3,6),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 1
([(0,5),(1,6),(2,3),(2,4),(3,6),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 1
([(0,6),(1,4),(2,5),(2,6),(3,5),(3,6),(4,5)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 1
([(0,4),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 1
([(0,5),(1,2),(1,3),(2,6),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 1
([(0,6),(1,6),(2,3),(2,4),(3,5),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 1
([(0,6),(1,4),(2,3),(2,6),(3,5),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 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: St001273
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001273: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001273: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 0
([(3,5),(4,5)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(2,5),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
([(2,5),(3,4),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 1
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,5),(1,5),(2,4),(3,4)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 1
([(0,5),(1,4),(2,3)],6)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
([(1,5),(2,4),(3,4),(3,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,6),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,6),(1,6),(2,5),(3,4),(3,6),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,5),(1,6),(2,3),(2,4),(3,6),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,6),(1,4),(2,5),(2,6),(3,5),(3,6),(4,5)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,4),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,5),(1,2),(1,3),(2,6),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,6),(1,6),(2,3),(2,4),(3,5),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
([(0,6),(1,4),(2,3),(2,6),(3,5),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
Description
The projective dimension of the first term in an injective coresolution of the regular module.
The algebra has the double centraliser property when 0 is returned and it is 1-Gorenstein in case a number < =1 is returned.
The following 42 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St000478Another weight of a partition according to Alladi. St001651The Frankl number of a lattice. 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. 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. St000454The largest eigenvalue of a graph if it is integral. St001845The number of join irreducibles minus the rank of a lattice. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001331The size of the minimal feedback vertex set. St001277The degeneracy of a graph. St001358The largest degree of a regular subgraph of a graph. St001330The hat guessing number of a graph. St001644The dimension of a graph. St001625The Möbius invariant of a lattice. St001621The number of atoms of a lattice. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001875The number of simple modules with projective dimension at most 1. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St001396Number of triples of incomparable elements in a finite poset. St001964The interval resolution global dimension of a poset. St000632The jump number of the poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001890The maximum magnitude of the Möbius function of a poset. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000910The number of maximal chains of minimal length in a poset. St001268The size of the largest ordinal summand in the poset. St001399The distinguishing number of a poset. St001779The order of promotion on the set of linear extensions of a poset. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St000189The number of elements in the poset. St000656The number of cuts of a poset. St001717The largest size of an interval in a poset.
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!