searching the database
Your data matches 304 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: St000548
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
St000548: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000548: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> []
=> 0
([],2)
=> []
=> 0
([(0,1)],2)
=> [1]
=> 1
([],3)
=> []
=> 0
([(1,2)],3)
=> [1]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1
([],4)
=> []
=> 0
([(2,3)],4)
=> [1]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> 2
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> 3
([(0,3),(1,2)],4)
=> [1,1]
=> 2
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> 3
([(1,2),(1,3),(2,3)],4)
=> [3]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> 1
([],5)
=> []
=> 0
([(3,4)],5)
=> [1]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> 2
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> 4
([(1,4),(2,3)],5)
=> [1,1]
=> 2
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> 3
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> 3
([(2,3),(2,4),(3,4)],5)
=> [3]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> 4
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> 5
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> 3
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> 5
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> 5
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> 3
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> 1
Description
The number of different non-empty partial sums of an integer partition.
Matching statistic: St001814
(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
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St001814: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St001814: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> []
=> []
=> 1 = 0 + 1
([],2)
=> []
=> []
=> 1 = 0 + 1
([(0,1)],2)
=> [1]
=> [1]
=> 2 = 1 + 1
([],3)
=> []
=> []
=> 1 = 0 + 1
([(1,2)],3)
=> [1]
=> [1]
=> 2 = 1 + 1
([(0,2),(1,2)],3)
=> [1,1]
=> [2]
=> 3 = 2 + 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> 2 = 1 + 1
([],4)
=> []
=> []
=> 1 = 0 + 1
([(2,3)],4)
=> [1]
=> [1]
=> 2 = 1 + 1
([(1,3),(2,3)],4)
=> [1,1]
=> [2]
=> 3 = 2 + 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [3]
=> 4 = 3 + 1
([(0,3),(1,2)],4)
=> [1,1]
=> [2]
=> 3 = 2 + 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [3]
=> 4 = 3 + 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1]
=> 2 = 1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 4 = 3 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1]
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,1,1,1,1]
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,1,1,1,1,1]
=> 2 = 1 + 1
([],5)
=> []
=> []
=> 1 = 0 + 1
([(3,4)],5)
=> [1]
=> [1]
=> 2 = 1 + 1
([(2,4),(3,4)],5)
=> [1,1]
=> [2]
=> 3 = 2 + 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [3]
=> 4 = 3 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [4]
=> 5 = 4 + 1
([(1,4),(2,3)],5)
=> [1,1]
=> [2]
=> 3 = 2 + 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [3]
=> 4 = 3 + 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [3]
=> 4 = 3 + 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1]
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [4]
=> 5 = 4 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [2,1,1]
=> 4 = 3 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> 6 = 5 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1]
=> 2 = 1 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> 4 = 3 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> 6 = 5 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [2,1,1,1,1]
=> 4 = 3 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,1,1,1,1,1]
=> 2 = 1 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1]
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [4]
=> 5 = 4 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [2,1,1]
=> 4 = 3 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> 6 = 5 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [2,2,2]
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,1,1,1,1]
=> 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1]
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1]
=> 2 = 1 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [2,1,1,1,1]
=> 4 = 3 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1]
=> 2 = 1 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [2,1,1,1,1,1]
=> 4 = 3 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1]
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,1,1,1,1,1,1]
=> 2 = 1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1]
=> 2 = 1 + 1
Description
The number of partitions interlacing the given partition.
Matching statistic: St000930
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000930: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 75%●distinct values known / distinct values provided: 67%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000930: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 75%●distinct values known / distinct values provided: 67%
Values
([],1)
=> []
=> []
=> []
=> ? = 0
([],2)
=> []
=> []
=> []
=> ? = 0
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> 1
([],3)
=> []
=> []
=> []
=> ? = 0
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
([],4)
=> []
=> []
=> []
=> ? = 0
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 1
([(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]
=> 3
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 3
([],5)
=> []
=> []
=> []
=> ? ∊ {0,1,1,1,1,2,5,5,5}
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 1
([(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]
=> 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 1
([(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]
=> 1
([(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]
=> 3
([(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]
=> 3
([(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]
=> 4
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
([(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]
=> 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 4
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 3
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? ∊ {0,1,1,1,1,2,5,5,5}
([(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]
=> 1
([(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]
=> 3
([(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]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 3
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? ∊ {0,1,1,1,1,2,5,5,5}
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 3
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> ? ∊ {0,1,1,1,1,2,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? ∊ {0,1,1,1,1,2,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? ∊ {0,1,1,1,1,2,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? ∊ {0,1,1,1,1,2,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? ∊ {0,1,1,1,1,2,5,5,5}
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? ∊ {0,1,1,1,1,2,5,5,5}
Description
The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver.
The $k$-Gorenstein degree is the maximal number $k$ such that the algebra is $k$-Gorenstein. We apply the convention that the value is equal to the global dimension of the algebra in case the $k$-Gorenstein degree is greater than or equal to the global dimension.
Matching statistic: St001184
(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
St001184: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001184: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Values
([],1)
=> []
=> []
=> ? = 0
([],2)
=> []
=> []
=> ? = 0
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> 1
([],3)
=> []
=> []
=> ? = 0
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> 1
([],4)
=> []
=> []
=> ? ∊ {0,3}
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 3
([(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]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? ∊ {0,3}
([],5)
=> []
=> []
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> 2
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> 2
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 3
([(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]
=> 4
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [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,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]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,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,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [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,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]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
Description
Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra.
Matching statistic: St000777
(load all 26 compositions to match this statistic)
(load all 26 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 1 = 0 + 1
([],2)
=> ([],2)
=> ([],1)
=> 1 = 0 + 1
([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 2 = 1 + 1
([],3)
=> ([],3)
=> ([],1)
=> 1 = 0 + 1
([(1,2)],3)
=> ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 2 + 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([],4)
=> ([],4)
=> ([],1)
=> 1 = 0 + 1
([(2,3)],4)
=> ([(2,3)],4)
=> ([(1,2)],3)
=> ? ∊ {1,2,2,3} + 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? ∊ {1,2,2,3} + 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ? ∊ {1,2,2,3} + 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 4 = 3 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ? ∊ {1,2,2,3} + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([],5)
=> ([],5)
=> ([],1)
=> 1 = 0 + 1
([(3,4)],5)
=> ([(3,4)],5)
=> ([(1,2)],3)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 4 = 3 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 5 = 4 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 5 = 4 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 5 = 4 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3 = 2 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? ∊ {1,1,1,1,1,2,2,3,3,5,5,5} + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
Description
The number of distinct eigenvalues of the distance Laplacian of a connected graph.
Matching statistic: St000005
(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
Mp00123: Dyck paths —Barnabei-Castronuovo involution⟶ Dyck paths
St000005: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00123: Dyck paths —Barnabei-Castronuovo involution⟶ Dyck paths
St000005: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Values
([],1)
=> []
=> []
=> []
=> ? = 0
([],2)
=> []
=> []
=> []
=> ? = 0
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([],3)
=> []
=> []
=> []
=> ? = 0
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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
([],4)
=> []
=> []
=> []
=> ? ∊ {0,3}
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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]
=> 3
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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]
=> 3
([(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,1,0,1,1,0,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
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ? ∊ {0,3}
([],5)
=> []
=> []
=> []
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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]
=> 3
([(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]
=> 4
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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]
=> 3
([(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]
=> 3
([(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]
=> 4
([(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
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,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,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,1,0,1,1,1,0,0,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 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,1,0,1,0,0,0]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(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]
=> 4
([(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
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,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,1,0,0,1,1,1,0,0,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
Description
The bounce statistic of a Dyck path.
The '''bounce path''' $D'$ of a Dyck path $D$ is the Dyck path obtained from $D$ by starting at the end point $(2n,0)$, traveling north-west until hitting $D$, then bouncing back south-west to the $x$-axis, and repeating this procedure until finally reaching the point $(0,0)$.
The points where $D'$ touches the $x$-axis are called '''bounce points''', and a bounce path is uniquely determined by its bounce points.
This statistic is given by the sum of all $i$ for which the bounce path $D'$ of $D$ touches the $x$-axis at $(2i,0)$.
In particular, the bounce statistics of $D$ and $D'$ coincide.
Matching statistic: St000120
(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
Mp00028: Dyck paths —reverse⟶ Dyck paths
St000120: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00028: Dyck paths —reverse⟶ Dyck paths
St000120: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Values
([],1)
=> []
=> []
=> []
=> ? = 0
([],2)
=> []
=> []
=> []
=> ? = 0
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([],3)
=> []
=> []
=> []
=> ? = 0
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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
([],4)
=> []
=> []
=> []
=> ? ∊ {0,3}
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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]
=> 3
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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]
=> 3
([(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
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ? ∊ {0,3}
([],5)
=> []
=> []
=> []
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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]
=> 3
([(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]
=> 4
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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]
=> 3
([(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]
=> 3
([(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]
=> 4
([(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
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 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),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(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]
=> 4
([(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]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
Description
The number of left tunnels of a Dyck path.
A tunnel is a pair (a,b) where a is the position of an open parenthesis and b is the position of the matching close parenthesis. If a+b
Matching statistic: St000329
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
St000329: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00118: Dyck paths —swap returns and last descent⟶ Dyck paths
St000329: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Values
([],1)
=> []
=> []
=> []
=> ? = 0
([],2)
=> []
=> []
=> []
=> ? = 0
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([],3)
=> []
=> []
=> []
=> ? = 0
([(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,1,0,0,1,0,0]
=> 2
([],4)
=> []
=> []
=> []
=> ? ∊ {0,2}
([(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,1,0,0,1,0,0]
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 3
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> ? ∊ {0,2}
([],5)
=> []
=> []
=> []
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
([(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,1,0,0,1,0,0]
=> 2
([(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,0,1,0,1,0,0]
=> 3
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,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,1,1,0,0,0,1,0,0]
=> 3
([(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
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,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,1,0,1,0,0,0]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> 4
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0]
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
([(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,0,1,0,1,0,0]
=> 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,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,1,1,0,0,0,1,1,0,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 3
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0]
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,1,0,0,0,0,1,0,0]
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,0]
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0]
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,0]
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0,0]
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0,0]
=> ? ∊ {0,1,1,1,3,3,3,3,4,5,5,5}
Description
The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1.
Matching statistic: St001185
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
St001185: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
St001185: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Values
([],1)
=> []
=> []
=> []
=> ? = 0
([],2)
=> []
=> []
=> []
=> ? = 0
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([],3)
=> []
=> []
=> []
=> ? = 0
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 1
([],4)
=> []
=> []
=> []
=> ? ∊ {0,3}
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 2
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 2
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [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]
=> [1,0,1,1,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? ∊ {0,3}
([],5)
=> []
=> []
=> []
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 2
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
([(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,1,0,0,0,0]
=> 4
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 2
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [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,1,1,0,1,0,0,0,0]
=> 4
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,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,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,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]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
([(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,0,0,1,0]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(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,1,0,0,0,0]
=> 4
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,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,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,1,1,0,0,0,1,0,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
Description
The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra.
Matching statistic: St001201
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
St001201: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001201: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 67%●distinct values known / distinct values provided: 67%
Values
([],1)
=> []
=> []
=> []
=> ? = 0
([],2)
=> []
=> []
=> []
=> ? = 0
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
([],3)
=> []
=> []
=> []
=> ? = 0
([(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]
=> 2
([(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
([],4)
=> []
=> []
=> []
=> ? ∊ {0,3}
([(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]
=> 2
([(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]
=> 3
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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]
=> 3
([(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]
=> 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
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? ∊ {0,3}
([],5)
=> []
=> []
=> []
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(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]
=> 2
([(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]
=> 3
([(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]
=> 4
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(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]
=> 3
([(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]
=> 3
([(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]
=> 4
([(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
([(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]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,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,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(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]
=> 4
([(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
([(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]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [10]
=> [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? ∊ {0,1,1,3,3,3,3,3,3,5,5,5}
Description
The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path.
The following 294 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001481The minimal height of a peak of a Dyck path. St001118The acyclic chromatic index of a graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001330The hat guessing number of a graph. St001645The pebbling number of a connected graph. St000260The radius of a connected graph. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000259The diameter of a connected graph. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000667The greatest common divisor of the parts of the partition. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001967The coefficient of the monomial corresponding to the integer partition in a certain power series. St001968The coefficient of the monomial corresponding to the integer partition in a certain power series. St000456The monochromatic index of a connected graph. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000741The Colin de Verdière graph invariant. St001613The binary logarithm of the size of the center of a lattice. St001617The dimension of the space of valuations of a lattice. St000455The second largest eigenvalue of a graph if it is integral. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000618The number of self-evacuating tableaux of given shape. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001389The number of partitions of the same length below the given integer partition. St001432The order dimension of the partition. St001570The minimal number of edges to add to make a graph Hamiltonian. St001592The maximal number of simple paths between any two different vertices of a graph. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St000003The number of standard Young tableaux of the partition. St000006The dinv of a Dyck path. St000010The length of the partition. St000026The position of the first return of a Dyck path. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000053The number of valleys of the Dyck path. St000063The number of linear extensions of a certain poset defined for an integer partition. St000075The orbit size of a standard tableau under promotion. St000079The number of alternating sign matrices for a given Dyck path. St000088The row sums of the character table of the symmetric group. St000108The number of partitions contained in the given partition. St000147The largest part of an integer partition. St000159The number of distinct parts of the integer partition. St000160The multiplicity of the smallest part of a partition. St000182The number of permutations whose cycle type is the given integer partition. St000183The side length of the Durfee square of an integer partition. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000275Number of permutations whose sorted list of non zero multiplicities of the Lehmer code is the given partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000288The number of ones in a binary word. St000290The major index of a binary word. St000291The number of descents of a binary word. St000296The length of the symmetric border of a binary word. St000297The number of leading ones in a binary word. St000306The bounce count of a Dyck path. St000321The number of integer partitions of n that are dominated by an integer partition. St000326The position of the first one in a binary word after appending a 1 at the end. St000331The number of upper interactions of a Dyck path. St000335The difference of lower and upper interactions. St000345The number of refinements of a partition. St000346The number of coarsenings of a partition. St000378The diagonal inversion number of an integer partition. St000390The number of runs of ones in a binary word. St000392The length of the longest run of ones in a binary word. St000393The number of strictly increasing runs in a binary word. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000517The Kreweras number of an integer partition. St000529The number of permutations whose descent word is the given binary word. St000531The leading coefficient of the rook polynomial of an integer partition. St000532The total number of rook placements on a Ferrers board. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000543The size of the conjugacy class of a binary word. St000626The minimal period of a binary word. St000627The exponent of a binary word. St000628The balance of a binary word. St000630The length of the shortest palindromic decomposition of a binary word. St000655The length of the minimal rise of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000691The number of changes of a binary word. St000705The number of semistandard tableaux on a given integer partition of n with maximal entry n. St000733The row containing the largest entry of a standard tableau. St000734The last entry in the first row of a standard tableau. St000738The first entry in the last row of a standard tableau. St000753The Grundy value for the game of Kayles on a binary word. St000783The side length of the largest staircase partition fitting into a partition. St000811The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to Schur symmetric functions. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000847The number of standard Young tableaux whose descent set is the binary word. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000876The number of factors in the Catalan decomposition of a binary word. St000885The number of critical steps in the Catalan decomposition of a binary word. St000897The number of different multiplicities of parts of an integer partition. St000913The number of ways to refine the partition into singletons. St000922The minimal number such that all substrings of this length are unique. St000935The number of ordered refinements of an integer partition. St000947The major index east count of a Dyck path. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000982The length of the longest constant subword. St000983The length of the longest alternating subword. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001129The product of the squares of the parts of a partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001161The major index north count of a Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001256Number of simple reflexive modules that are 2-stable reflexive. St001267The length of the Lyndon factorization of the binary word. St001274The number of indecomposable injective modules with projective dimension equal to two. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001313The number of Dyck paths above the lattice path given by a binary word. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001372The length of a longest cyclic run of ones of a binary word. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001400The total number of Littlewood-Richardson tableaux of given shape. St001415The length of the longest palindromic prefix of a binary word. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001437The flex of a binary word. St001462The number of factors of a standard tableaux under concatenation. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001485The modular major index of a binary word. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001498The normalised height of a Nakayama algebra with magnitude 1. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001595The number of standard Young tableaux of the skew partition. St001597The Frobenius rank of a skew partition. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001614The cyclic permutation representation number of a skew partition. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001721The degree of a binary word. St001722The number of minimal chains with small intervals between a binary word and the top element. St001732The number of peaks visible from the left. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001838The number of nonempty primitive factors of a binary word. St001884The number of borders of a binary word. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001281The normalized isoperimetric number of a graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000454The largest eigenvalue of a graph if it is integral. St000776The maximal multiplicity of an eigenvalue in a graph. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St000460The hook length of the last cell along the main diagonal of an integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001360The number of covering relations in Young's lattice below a partition. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001563The value of the power-sum symmetric function evaluated at 1. St001593This is the number of standard Young tableaux of the given shifted shape. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St001128The exponens consonantiae of a partition. St001877Number of indecomposable injective modules with projective dimension 2. St000284The Plancherel distribution on integer partitions. St000567The sum of the products of all pairs of parts. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000640The rank of the largest boolean interval in a poset. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001637The number of (upper) dissectors of a poset. St001890The maximum magnitude of the Möbius function of a poset. St000478Another weight of a partition according to Alladi. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000934The 2-degree of an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000993The multiplicity of the largest part of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000707The product of the factorials of the parts. St000264The girth of a graph, which is not a tree. St000420The number of Dyck paths that are weakly above a Dyck path. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000678The number of up steps after the last double rise of a Dyck path. St000706The product of the factorials of the multiplicities of an integer partition. St000735The last entry on the main diagonal of a standard tableau. St000744The length of the path to the largest entry in a standard Young tableau. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001500The global dimension of magnitude 1 Nakayama algebras. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001812The biclique partition number of a graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St001060The distinguishing index of a graph. St001875The number of simple modules with projective dimension at most 1. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001644The dimension of a graph. 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. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000137The Grundy value of an integer partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001383The BG-rank of an integer partition. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001651The Frankl number of a lattice. St000302The determinant of the distance matrix of a connected graph. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph.
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!