searching the database
Your data matches 310 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: St000535
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Values
([],2)
=> 0
([(0,1)],2)
=> 1
([],3)
=> 0
([(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> 0
([(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2)],4)
=> 1
([(0,3),(1,2),(2,3)],4)
=> 1
([(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],5)
=> 0
([(3,4)],5)
=> 1
([(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(1,4),(2,3)],5)
=> 1
([(1,4),(2,3),(3,4)],5)
=> 1
([(0,1),(2,4),(3,4)],5)
=> 1
([(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The rank-width of a graph.
Matching statistic: St000481
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00251: Graphs —clique sizes⟶ Integer partitions
St000481: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000481: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],2)
=> [1,1]
=> 1
([(0,1)],2)
=> [2]
=> 0
([],3)
=> [1,1,1]
=> 1
([(1,2)],3)
=> [2,1]
=> 1
([(0,2),(1,2)],3)
=> [2,2]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> 0
([],4)
=> [1,1,1,1]
=> 1
([(2,3)],4)
=> [2,1,1]
=> 1
([(1,3),(2,3)],4)
=> [2,2,1]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> 1
([(0,3),(1,2)],4)
=> [2,2]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [2,2,2]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2,2,2]
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,3]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
([],5)
=> [1,1,1,1,1]
=> 1
([(3,4)],5)
=> [2,1,1,1]
=> 1
([(2,4),(3,4)],5)
=> [2,2,1,1]
=> 2
([(1,4),(2,4),(3,4)],5)
=> [2,2,2,1]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [2,2,2,2]
=> 1
([(1,4),(2,3)],5)
=> [2,2,1]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [2,2,2,1]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [2,2,2]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [2,2,2,2]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2,1]
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2,2]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,2,2,1]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [2,2,2,2,2]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,1]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,2,2]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,2]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,2,2,2,2]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,3]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [2,2,2,2]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,2,2]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,2,2,2]
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,2,2,2]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,3]
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,3,2]
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,2]
=> 1
([(0,3),(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)],5)
=> [3,3,2,2]
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [3,3,3,3]
=> 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,4]
=> 1
Description
The number of upper covers of a partition in dominance order.
Matching statistic: St000897
(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
St000897: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000897: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],2)
=> []
=> 0
([(0,1)],2)
=> [1]
=> 1
([],3)
=> []
=> 0
([(1,2)],3)
=> [1]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1
([],4)
=> []
=> 0
([(2,3)],4)
=> [1]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> 1
([(0,3),(1,2)],4)
=> [1,1]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 1
([(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]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> 1
([(1,4),(2,3)],5)
=> [1,1]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> 1
([(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]
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> 1
([(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]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> 1
([(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]
=> 1
([(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]
=> 1
([(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
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> 1
Description
The number of different multiplicities of parts of an integer partition.
Matching statistic: St000480
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00117: Graphs —Ore closure⟶ Graphs
Mp00251: Graphs —clique sizes⟶ Integer partitions
St000480: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00251: Graphs —clique sizes⟶ Integer partitions
St000480: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],2)
=> ([],2)
=> [1,1]
=> 0
([(0,1)],2)
=> ([(0,1)],2)
=> [2]
=> 1
([],3)
=> ([],3)
=> [1,1,1]
=> 0
([(1,2)],3)
=> ([(1,2)],3)
=> [2,1]
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> [2,2]
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1
([],4)
=> ([],4)
=> [1,1,1,1]
=> 0
([(2,3)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> 1
([(1,3),(2,3)],4)
=> ([(1,3),(2,3)],4)
=> [2,2,1]
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> 1
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> [2,2]
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [2,2,2]
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 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)
=> [4]
=> 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)
=> [4]
=> 1
([],5)
=> ([],5)
=> [1,1,1,1,1]
=> 0
([(3,4)],5)
=> ([(3,4)],5)
=> [2,1,1,1]
=> 1
([(2,4),(3,4)],5)
=> ([(2,4),(3,4)],5)
=> [2,2,1,1]
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,4),(3,4)],5)
=> [2,2,2,1]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> [2,2,2,2]
=> 1
([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> [2,2,1]
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [2,2,2,1]
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,4),(3,4)],5)
=> [2,2,2]
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> [2,2,2,2]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2,1]
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2,2]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 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)
=> [3,3,2]
=> 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)
=> [4,1]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,2,2]
=> 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)
=> [3,3,2]
=> 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)
=> [3,3,3]
=> 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)
=> [3,3,3]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [2,2,2,2]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,2,2]
=> 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)
=> [3,3]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,2,2,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)
=> [5]
=> 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)
=> [5]
=> 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)
=> [4,2]
=> 2
([(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)
=> [4,1]
=> 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)
=> [4,2]
=> 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)
=> [5]
=> 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)
=> [5]
=> 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)
=> [5]
=> 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)
=> [5]
=> 1
Description
The number of lower covers of a partition in dominance order.
According to [1], Corollary 2.4, the maximum number of elements one element (apparently for $n\neq 2$) can cover is
$$
\frac{1}{2}(\sqrt{1+8n}-3)
$$
and an element which covers this number of elements is given by $(c+i,c,c-1,\dots,3,2,1)$, where $1\leq i\leq c+2$.
Matching statistic: St000659
(load all 23 compositions to match this statistic)
(load all 23 compositions to match this statistic)
Mp00251: Graphs —clique sizes⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000659: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000659: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],2)
=> [1,1]
=> [1,1,0,0]
=> 1
([(0,1)],2)
=> [2]
=> [1,0,1,0]
=> 0
([],3)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 1
([(1,2)],3)
=> [2,1]
=> [1,0,1,1,0,0]
=> 1
([(0,2),(1,2)],3)
=> [2,2]
=> [1,1,1,0,0,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([],4)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 1
([(2,3)],4)
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 1
([(1,3),(2,3)],4)
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 1
([(0,3),(1,2)],4)
=> [2,2]
=> [1,1,1,0,0,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2,2,2]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([],5)
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
([(3,4)],5)
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
([(2,4),(3,4)],5)
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [2,2,2,2]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
([(1,4),(2,3)],5)
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [2,2,2,2]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,2,2,1]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [2,2,2,2,2]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,2,2,2,2]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,3]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [2,2,2,2]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,2,2]
=> [1,0,1,1,1,1,0,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
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,2,2,2]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,2,2,2]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,3,3]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [3,3,2,2]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [3,3,3,3]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1
Description
The number of rises of length at least 2 of a Dyck path.
Matching statistic: St001674
Values
([],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 + 1
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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)
=> 2 = 1 + 1
([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,3),(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,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(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,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)
=> 2 = 1 + 1
([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(1,4),(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)
=> 2 = 1 + 1
([(0,4),(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
([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 2 = 1 + 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(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)
=> 2 = 1 + 1
([(0,4),(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
([(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)
=> 2 = 1 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(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),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 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)
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(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),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,4),(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,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,3),(0,4),(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,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 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)
=> 2 = 1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(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,3),(0,4),(1,2),(1,4),(2,3)],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,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,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 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)
=> 2 = 1 + 1
([(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),(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
Description
The number of vertices of the largest induced star graph in the graph.
Matching statistic: St000761
Mp00259: Graphs —vertex addition⟶ Graphs
Mp00152: Graphs —Laplacian multiplicities⟶ Integer compositions
Mp00041: Integer compositions —conjugate⟶ Integer compositions
St000761: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00152: Graphs —Laplacian multiplicities⟶ Integer compositions
Mp00041: Integer compositions —conjugate⟶ Integer compositions
St000761: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],2)
=> ([],3)
=> [3] => [1,1,1] => 0
([(0,1)],2)
=> ([(1,2)],3)
=> [1,2] => [1,2] => 1
([],3)
=> ([],4)
=> [4] => [1,1,1,1] => 0
([(1,2)],3)
=> ([(2,3)],4)
=> [1,3] => [1,1,2] => 1
([(0,2),(1,2)],3)
=> ([(1,3),(2,3)],4)
=> [1,1,2] => [1,3] => 1
([(0,1),(0,2),(1,2)],3)
=> ([(1,2),(1,3),(2,3)],4)
=> [2,2] => [1,2,1] => 1
([],4)
=> ([],5)
=> [5] => [1,1,1,1,1] => 0
([(2,3)],4)
=> ([(3,4)],5)
=> [1,4] => [1,1,1,2] => 1
([(1,3),(2,3)],4)
=> ([(2,4),(3,4)],5)
=> [1,1,3] => [1,1,3] => 1
([(0,3),(1,3),(2,3)],4)
=> ([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => [1,2,2] => 1
([(0,3),(1,2)],4)
=> ([(1,4),(2,3)],5)
=> [2,3] => [1,1,2,1] => 1
([(0,3),(1,2),(2,3)],4)
=> ([(1,4),(2,3),(3,4)],5)
=> [1,1,1,2] => [1,4] => 1
([(1,2),(1,3),(2,3)],4)
=> ([(2,3),(2,4),(3,4)],5)
=> [2,3] => [1,1,2,1] => 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,2] => [1,4] => 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> [1,2,2] => [1,2,2] => 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => [1,3,1] => 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2] => [1,2,1,1] => 1
([],5)
=> ([],6)
=> [6] => [1,1,1,1,1,1] => 0
([(3,4)],5)
=> ([(4,5)],6)
=> [1,5] => [1,1,1,1,2] => 1
([(2,4),(3,4)],5)
=> ([(3,5),(4,5)],6)
=> [1,1,4] => [1,1,1,3] => 1
([(1,4),(2,4),(3,4)],5)
=> ([(2,5),(3,5),(4,5)],6)
=> [1,2,3] => [1,1,2,2] => 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(1,5),(2,5),(3,5),(4,5)],6)
=> [1,3,2] => [1,2,1,2] => 2
([(1,4),(2,3)],5)
=> ([(2,5),(3,4)],6)
=> [2,4] => [1,1,1,2,1] => 1
([(1,4),(2,3),(3,4)],5)
=> ([(2,5),(3,4),(4,5)],6)
=> [1,1,1,3] => [1,1,4] => 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2),(3,5),(4,5)],6)
=> [1,1,1,3] => [1,1,4] => 1
([(2,3),(2,4),(3,4)],5)
=> ([(3,4),(3,5),(4,5)],6)
=> [2,4] => [1,1,1,2,1] => 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(1,5),(2,5),(3,4),(4,5)],6)
=> [1,1,1,1,2] => [1,5] => 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,5),(3,4),(3,5),(4,5)],6)
=> [1,1,1,3] => [1,1,4] => 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,1,2,2] => [1,2,3] => 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(2,4),(2,5),(3,4),(3,5)],6)
=> [1,2,3] => [1,1,2,2] => 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [1,1,1,1,2] => [1,5] => 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [2,1,3] => [1,1,3,1] => 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [1,1,1,1,2] => [1,5] => 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,1,1,1,2] => [1,5] => 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> [1,1,2,2] => [1,2,3] => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [2,2,2] => [1,2,2,1] => 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(1,5),(2,4),(3,4),(3,5)],6)
=> [1,1,1,1,2] => [1,5] => 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(3,4),(3,5),(4,5)],6)
=> [2,1,3] => [1,1,3,1] => 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> [1,1,1,1,2] => [1,5] => 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> [1,2,1,2] => [1,3,2] => 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
=> [2,2,2] => [1,2,2,1] => 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> [1,1,1,1,2] => [1,5] => 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,1,1,1,2] => [1,5] => 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> [1,1,1,1,2] => [1,5] => 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,3] => [1,1,2,1,1] => 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [1,2,1,2] => [1,3,2] => 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [2,1,1,2] => [1,4,1] => 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> [1,1,1,1,2] => [1,5] => 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> [2,2,2] => [1,2,2,1] => 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,2] => [1,3,1,1] => 1
Description
The number of ascents in an integer composition.
A composition has an ascent, or rise, at position $i$ if $a_i < a_{i+1}$.
Matching statistic: St000920
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000920: 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
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000920: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],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,1,0,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([],4)
=> []
=> []
=> []
=> 0
([(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,1,0,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,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,1,0,0,1,0,1,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,0,0,1,0,1,0,1,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,0,0,1,0,1,0,1,0,1,0,1,0]
=> 1
([],5)
=> []
=> []
=> []
=> 0
([(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,1,0,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,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,1,0,1,0,1,0,1,0,0]
=> 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,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,0,1,0,1,0,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,0,1,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,1,0,0,1,0,0]
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,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,0,0,1,0,1,1,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,1,0,0,1,0,1,0,1,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,1,0,0,1,0,0]
=> 2
([(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,0,1,0,1,0,1,1,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,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> 1
([(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,0,0,1,0,1,0,1,0,1,0,1,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,0,1,0,1,0,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,0,1,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,1,0,0,1,0,0]
=> 2
([(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,1,0,0,1,0,1,0]
=> 1
([(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,0,0,1,0,1,0,1,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,0,0,1,0,1,0,1,0,1,0,1,0]
=> 1
([(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,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 1
([(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,0,1,0,1,0,1,1,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,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> 1
([(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,0,1,0,1,0,1,0,1,1,0,0]
=> 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,0,0,0,0,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 1
([(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,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 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,0,0,0,0,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 1
([(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,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 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: St000985
Values
([],2)
=> ([],1)
=> [1] => ([],1)
=> 0
([(0,1)],2)
=> ([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> 1
([],3)
=> ([],1)
=> [1] => ([],1)
=> 0
([(1,2)],3)
=> ([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> 1
([],4)
=> ([],1)
=> [1] => ([],1)
=> 0
([(2,3)],4)
=> ([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> 1
([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> 1
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> 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)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
([],5)
=> ([],1)
=> [1] => ([],1)
=> 0
([(3,4)],5)
=> ([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> 1
([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> 1
([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> [2,3] => ([(2,4),(3,4)],5)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 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)
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 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)
=> [3,2] => ([(1,4),(2,4),(3,4)],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)
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> 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),(1,2),(1,3),(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
Description
The number of positive eigenvalues of the adjacency matrix of the graph.
Matching statistic: St001011
(load all 21 compositions to match this statistic)
(load all 21 compositions to match this statistic)
Mp00152: Graphs —Laplacian multiplicities⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
St001011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
St001011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],2)
=> [2] => [1,1,0,0]
=> [1,1,0,0]
=> 0
([(0,1)],2)
=> [1,1] => [1,0,1,0]
=> [1,0,1,0]
=> 1
([],3)
=> [3] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0
([(1,2)],3)
=> [1,2] => [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
([(0,2),(1,2)],3)
=> [1,1,1] => [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [2,1] => [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 1
([],4)
=> [4] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(2,3)],4)
=> [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> 1
([(0,3),(1,2)],4)
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
([],5)
=> [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(3,4)],5)
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
([(1,4),(2,3)],5)
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,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,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1
Description
Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path.
The following 300 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001354The number of series nodes in the modular decomposition of a graph. 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. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St000389The number of runs of ones of odd length in a binary word. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St000182The number of permutations whose cycle type is the given integer partition. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. 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. St001732The number of peaks visible from the left. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001884The number of borders of a binary word. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001267The length of the Lyndon factorization of the binary word. St001413Half the length of the longest even length palindromic prefix of a binary word. St001437The flex of a binary word. St001613The binary logarithm of the size of the center of a lattice. St001617The dimension of the space of valuations of a lattice. St001616The number of neutral elements in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St001754The number of tolerances of a finite lattice. St000785The number of distinct colouring schemes of a graph. St000093The cardinality of a maximal independent set of vertices of a graph. St000260The radius of a connected graph. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000763The sum of the positions of the strong records of an integer composition. St000764The number of strong records in an integer composition. St000775The multiplicity of the largest eigenvalue in a graph. St000805The number of peaks of the associated bargraph. St001128The exponens consonantiae of a partition. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001597The Frobenius rank of a skew partition. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000258The burning number of a graph. St000918The 2-limited packing number of a graph. St000024The number of double up and double down steps of a Dyck path. St000097The order of the largest clique of the graph. St000340The number of non-final maximal constant sub-paths of length greater than one. St000442The maximal area to the right of an up step of a Dyck path. St000658The number of rises of length 2 of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000932The number of occurrences of the pattern UDU in a Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with 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. St001272The number of graphs with the same degree sequence. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000735The last entry on the main diagonal of a standard tableau. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St000053The number of valleys of the Dyck path. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. 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$. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001340The cardinality of a minimal non-edge isolating set of a graph. St000079The number of alternating sign matrices for a given Dyck path. St000273The domination number of a graph. St000287The number of connected components of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000544The cop number of a graph. St000553The number of blocks of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000916The packing number of a graph. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001057The Grundy value of the game of creating an independent set in a graph. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001282The number of graphs with the same chromatic polynomial. 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. St001322The size of a minimal independent dominating set in a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001363The Euler characteristic of a graph according to Knill. St001463The number of distinct columns in the nullspace of a graph. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001829The common independence number of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000268The number of strongly connected orientations of a graph. St000286The number of connected components of the complement of a graph. St000344The number of strongly connected outdegree sequences of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000482The (zero)-forcing number of a graph. St000618The number of self-evacuating tableaux of given shape. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000781The number of proper colouring schemes of a Ferrers diagram. St000874The position of the last double rise in a Dyck path. St000946The sum of the skew hook positions in a Dyck path. St000976The sum of the positions of double up-steps of a Dyck path. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001073The number of nowhere zero 3-flows of a graph. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. 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. St001256Number of simple reflexive modules that are 2-stable reflexive. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001280The number of parts of an integer partition that are at least two. St001286The annihilation number of a graph. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001593This is the number of standard Young tableaux of the given shifted shape. St001716The 1-improper chromatic number of a graph. St001780The order of promotion on the set of standard tableaux of given shape. St001890The maximum magnitude of the Möbius function of a poset. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001957The number of Hasse diagrams with a given underlying undirected graph. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St000284The Plancherel distribution on integer partitions. St000668The least common multiple of the parts of the partition. St000706The product of the factorials of the multiplicities of an integer partition. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000815The number of semistandard Young tableaux of partition weight of given shape. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000993The multiplicity of the largest part of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000762The sum of the positions of the weak records of an integer composition. St001333The cardinality of a minimal edge-isolating set of a graph. St001393The induced matching number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. 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$. St001204Call 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. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001481The minimal height of a peak of a Dyck path. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St000331The number of upper interactions of a Dyck path. St000741The Colin de Verdière graph invariant. St000999Number of indecomposable projective module with injective dimension equal to the global dimension 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. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. 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$. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000259The diameter of a connected graph. St001722The number of minimal chains with small intervals between a binary word and the top element. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. 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. St001274The number of indecomposable injective modules with projective dimension equal to two. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension 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. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St000667The greatest common divisor of the parts of the partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001571The Cartan determinant of the integer partition. 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. St001044The number of pairs whose larger element is at most one more than half the size of the perfect matching. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000455The second largest eigenvalue of a graph if it is integral. St000928The sum of the coefficients of the character polynomial of an integer partition. St000454The largest eigenvalue of a graph if it is integral. St000456The monochromatic index of a connected graph. St001281The normalized isoperimetric number of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. 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. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St000003The number of standard Young tableaux of the partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000075The orbit size of a standard tableau under promotion. St000088The row sums of the character table of the symmetric group. St000159The number of distinct parts of the 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. St000291The number of descents of 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. St000345The number of refinements of a partition. St000390The number of runs of ones in a binary word. St000517The Kreweras number of an integer partition. St000529The number of permutations whose descent word is the given binary word. 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. St000705The number of semistandard tableaux on a given integer partition of n with maximal entry n. St000783The side length of the largest staircase partition fitting into a partition. 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. St000913The number of ways to refine the partition into singletons. St000935The number of ordered refinements of an integer partition. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000983The length of the longest alternating subword. 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. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001313The number of Dyck paths above the lattice path given by a binary word. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001595The number of standard Young tableaux of the skew partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. 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. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001118The acyclic chromatic index of a graph. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000907The number of maximal antichains of minimal length in a poset. St001520The number of strict 3-descents. St001877Number of indecomposable injective modules with projective dimension 2. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000914The sum of the values of the Möbius function of a poset. 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. St000478Another weight of a partition according to Alladi. St000934The 2-degree of an integer partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000681The Grundy value of Chomp on Ferrers diagrams. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. 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. St001383The BG-rank of an integer partition. St001389The number of partitions of the same length below the given integer partition. St001651The Frankl number of a lattice. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number 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!