Your data matches 135 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000443
(load all 4 compositions to match this statistic)
Mapping
Mp00307: Posets —promotion cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000443: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => [1]
 => [1,0,1,0]
 => 1
([],2)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => 1
([],3)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,2),(2,1)],3)
 => [1]
 => [1,0,1,0]
 => 1
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,1),(0,2),(0,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,2),(0,3),(3,1)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(1,2),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,3),(3,1),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(1,3),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,3),(1,2)],4)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,3),(1,2),(1,3)],4)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,3),(2,1),(3,2)],4)
 => [1]
 => [1,0,1,0]
 => 1
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(4,1),(4,2),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,4),(1,4),(4,2),(4,3)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(1,4),(2,4),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,4),(1,4),(2,3),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,4),(1,2),(1,4),(2,3)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 4
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,2),(0,4),(3,1),(4,3)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,4),(1,2),(1,3),(3,4)],5)
 => [4,4,3]
 => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
 => [5,3]
 => [1,1,1,1,0,0,0,1,0,0,1,0]
 => 4
([(0,3),(1,2),(1,4),(3,4)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 4
([(1,4),(3,2),(4,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 5
([(0,3),(3,4),(4,1),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,4),(1,2),(2,4),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,4),(3,2),(4,1),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,4),(2,3),(3,1),(4,2)],5)
 => [1]
 => [1,0,1,0]
 => 1
([(0,3),(1,2),(2,4),(3,4)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,4),(1,2),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(4,5),(5,1),(5,2),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,5),(1,5),(2,5),(3,4),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
Description
The number of long tunnels of a Dyck path. A long tunnel of a Dyck path is a longest sequence of consecutive usual tunnels, i.e., a longest sequence of tunnels where the end point of one is the starting point of the next. See [1] for the definition of tunnels.
Matching statistic: St001007
(load all 4 compositions to match this statistic)
Mapping
Mp00307: Posets —promotion cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001007: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => [1]
 => [1,0,1,0]
 => 1
([],2)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => 1
([],3)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,2),(2,1)],3)
 => [1]
 => [1,0,1,0]
 => 1
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,1),(0,2),(0,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,2),(0,3),(3,1)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(1,2),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,3),(3,1),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(1,3),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,3),(1,2)],4)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,3),(1,2),(1,3)],4)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,3),(2,1),(3,2)],4)
 => [1]
 => [1,0,1,0]
 => 1
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(4,1),(4,2),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,4),(1,4),(4,2),(4,3)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(1,4),(2,4),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,4),(1,4),(2,3),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,4),(1,2),(1,4),(2,3)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 4
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,2),(0,4),(3,1),(4,3)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,4),(1,2),(1,3),(3,4)],5)
 => [4,4,3]
 => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
 => [5,3]
 => [1,1,1,1,0,0,0,1,0,0,1,0]
 => 4
([(0,3),(1,2),(1,4),(3,4)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 4
([(1,4),(3,2),(4,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 5
([(0,3),(3,4),(4,1),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,4),(1,2),(2,4),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,4),(3,2),(4,1),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,4),(2,3),(3,1),(4,2)],5)
 => [1]
 => [1,0,1,0]
 => 1
([(0,3),(1,2),(2,4),(3,4)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,4),(1,2),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(4,5),(5,1),(5,2),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,5),(1,5),(2,5),(3,4),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
Description
Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001187
(load all 4 compositions to match this statistic)
Mapping
Mp00307: Posets —promotion cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001187: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => [1]
 => [1,0,1,0]
 => 1
([],2)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => 1
([],3)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,2),(2,1)],3)
 => [1]
 => [1,0,1,0]
 => 1
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,1),(0,2),(0,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,2),(0,3),(3,1)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(1,2),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,3),(3,1),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(1,3),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,3),(1,2)],4)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,3),(1,2),(1,3)],4)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,3),(2,1),(3,2)],4)
 => [1]
 => [1,0,1,0]
 => 1
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(4,1),(4,2),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,4),(1,4),(4,2),(4,3)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(1,4),(2,4),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,4),(1,4),(2,3),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,4),(1,2),(1,4),(2,3)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 4
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,2),(0,4),(3,1),(4,3)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,4),(1,2),(1,3),(3,4)],5)
 => [4,4,3]
 => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
 => [5,3]
 => [1,1,1,1,0,0,0,1,0,0,1,0]
 => 4
([(0,3),(1,2),(1,4),(3,4)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 4
([(1,4),(3,2),(4,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 5
([(0,3),(3,4),(4,1),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,4),(1,2),(2,4),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,4),(3,2),(4,1),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,4),(2,3),(3,1),(4,2)],5)
 => [1]
 => [1,0,1,0]
 => 1
([(0,3),(1,2),(2,4),(3,4)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,4),(1,2),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(4,5),(5,1),(5,2),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,5),(1,5),(2,5),(3,4),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
Description
The number of simple modules with grade at least one in the corresponding Nakayama algebra.
Matching statistic: St001224
(load all 4 compositions to match this statistic)
Mapping
Mp00307: Posets —promotion cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001224: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => [1]
 => [1,0,1,0]
 => 1
([],2)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => 1
([],3)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,2),(2,1)],3)
 => [1]
 => [1,0,1,0]
 => 1
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,1),(0,2),(0,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,2),(0,3),(3,1)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(1,2),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,3),(3,1),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(1,3),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,3),(1,2)],4)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,3),(1,2),(1,3)],4)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,3),(2,1),(3,2)],4)
 => [1]
 => [1,0,1,0]
 => 1
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(4,1),(4,2),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,4),(1,4),(4,2),(4,3)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(1,4),(2,4),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,4),(1,4),(2,3),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,4),(1,2),(1,4),(2,3)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 4
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,2),(0,4),(3,1),(4,3)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,4),(1,2),(1,3),(3,4)],5)
 => [4,4,3]
 => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
 => [5,3]
 => [1,1,1,1,0,0,0,1,0,0,1,0]
 => 4
([(0,3),(1,2),(1,4),(3,4)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 4
([(1,4),(3,2),(4,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 5
([(0,3),(3,4),(4,1),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,4),(1,2),(2,4),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,4),(3,2),(4,1),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,4),(2,3),(3,1),(4,2)],5)
 => [1]
 => [1,0,1,0]
 => 1
([(0,3),(1,2),(2,4),(3,4)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,4),(1,2),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(4,5),(5,1),(5,2),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,5),(1,5),(2,5),(3,4),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
Description
Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. Then the statistic gives the vector space dimension of the first Ext-group between X and the regular module.
Matching statistic: St001297
(load all 3 compositions to match this statistic)
Mapping
Mp00307: Posets —promotion cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001297: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => [1]
 => [1,0,1,0]
 => 1
([],2)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => 1
([],3)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,2),(2,1)],3)
 => [1]
 => [1,0,1,0]
 => 1
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,1),(0,2),(0,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,2),(0,3),(3,1)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(1,2),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,3),(3,1),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(1,3),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,3),(1,2)],4)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,3),(1,2),(1,3)],4)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,3),(2,1),(3,2)],4)
 => [1]
 => [1,0,1,0]
 => 1
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(4,1),(4,2),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,4),(1,4),(4,2),(4,3)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(1,4),(2,4),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,4),(1,4),(2,3),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,4),(1,2),(1,4),(2,3)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 4
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 2
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,2),(0,4),(3,1),(4,3)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,4),(1,2),(1,3),(3,4)],5)
 => [4,4,3]
 => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
 => [5,3]
 => [1,1,1,1,0,0,0,1,0,0,1,0]
 => 4
([(0,3),(1,2),(1,4),(3,4)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 4
([(1,4),(3,2),(4,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 5
([(0,3),(3,4),(4,1),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,4),(1,2),(2,4),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,4),(3,2),(4,1),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 3
([(0,4),(2,3),(3,1),(4,2)],5)
 => [1]
 => [1,0,1,0]
 => 1
([(0,3),(1,2),(2,4),(3,4)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
([(0,4),(1,2),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 3
([(0,4),(4,5),(5,1),(5,2),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
([(0,5),(1,5),(2,5),(3,4),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 4
Description
The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. Here an indecomposable non-injective projective module P is said to have reflexive Auslander-Reiten sequences in case every term in the Auslander-Reiten sequence for P is reflexive. The Dyck paths where the statistic returns the value 0 are of special interesting, see [1].
Matching statistic: St000024
(load all 4 compositions to match this statistic)
Mapping
Mp00307: Posets —promotion cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => [1]
 => [1,0,1,0]
 => 0 = 1 - 1
([],2)
 => [2]
 => [1,1,0,0,1,0]
 => 1 = 2 - 1
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => 0 = 1 - 1
([],3)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 3 = 4 - 1
([(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 2 = 3 - 1
([(0,1),(0,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 1 = 2 - 1
([(0,2),(2,1)],3)
 => [1]
 => [1,0,1,0]
 => 0 = 1 - 1
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => 1 = 2 - 1
([(0,1),(0,2),(0,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 3 = 4 - 1
([(0,2),(0,3),(3,1)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 2 = 3 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 1 = 2 - 1
([(1,2),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 3 = 4 - 1
([(0,3),(3,1),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 1 = 2 - 1
([(0,3),(1,3),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 3 = 4 - 1
([(0,3),(1,2)],4)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 2 = 3 - 1
([(0,3),(1,2),(1,3)],4)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 2 = 3 - 1
([(0,3),(2,1),(3,2)],4)
 => [1]
 => [1,0,1,0]
 => 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 2 = 3 - 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 3 = 4 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 1 = 2 - 1
([(0,3),(0,4),(3,2),(4,1)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 2 = 3 - 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 1 = 2 - 1
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 2 = 3 - 1
([(0,4),(4,1),(4,2),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 3 = 4 - 1
([(0,4),(1,4),(4,2),(4,3)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 2 = 3 - 1
([(0,4),(1,4),(2,4),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 3 = 4 - 1
([(0,4),(1,4),(2,3),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 1 = 2 - 1
([(0,4),(1,2),(1,4),(2,3)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 3 = 4 - 1
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 2 = 3 - 1
([(0,2),(0,4),(3,1),(4,3)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 3 = 4 - 1
([(0,4),(1,2),(1,3),(3,4)],5)
 => [4,4,3]
 => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 3 = 4 - 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 2 = 3 - 1
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
 => [5,3]
 => [1,1,1,1,0,0,0,1,0,0,1,0]
 => 3 = 4 - 1
([(0,3),(1,2),(1,4),(3,4)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 3 = 4 - 1
([(1,4),(3,2),(4,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 4 = 5 - 1
([(0,3),(3,4),(4,1),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 1 = 2 - 1
([(0,4),(1,2),(2,4),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 2 = 3 - 1
([(0,4),(3,2),(4,1),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => 2 = 3 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => [1]
 => [1,0,1,0]
 => 0 = 1 - 1
([(0,3),(1,2),(2,4),(3,4)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => 2 = 3 - 1
([(0,4),(1,2),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => 3 = 4 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => 1 = 2 - 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 3 = 4 - 1
([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 2 = 3 - 1
([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => 2 = 3 - 1
([(0,4),(4,5),(5,1),(5,2),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 3 = 4 - 1
([(0,5),(1,5),(2,5),(3,4),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => 3 = 4 - 1
Description
The number of double up and double down steps of a Dyck path. In other words, this is the number of double rises (and, equivalently, the number of double falls) of a Dyck path.
Matching statistic: St000015
(load all 4 compositions to match this statistic)
Mapping
Mp00307: Posets —promotion cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St000015: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([],2)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([],3)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,1),(0,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,2),(2,1)],3)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,1),(0,2),(0,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,2),(0,3),(3,1)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(1,2),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => 4
([(0,3),(3,1),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,3),(1,3),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,3),(1,2)],4)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => 3
([(0,3),(1,2),(1,3)],4)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,3),(2,1),(3,2)],4)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => 3
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,0]
 => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,4),(4,1),(4,2),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,4),(1,4),(4,2),(4,3)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,4),(1,4),(2,4),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,4),(1,4),(2,3),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,4),(1,2),(1,4),(2,3)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,1,0,0,0]
 => 4
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,0]
 => 2
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,2),(0,4),(3,1),(4,3)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => 4
([(0,4),(1,2),(1,3),(3,4)],5)
 => [4,4,3]
 => [1,1,1,0,0,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
 => [5,3]
 => [1,1,1,1,0,0,0,1,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,1,0,0]
 => 4
([(0,3),(1,2),(1,4),(3,4)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,1,0,0,0]
 => 4
([(1,4),(3,2),(4,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,1,0,0]
 => 5
([(0,3),(3,4),(4,1),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,4),(1,2),(2,4),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,4),(3,2),(4,1),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,4),(2,3),(3,1),(4,2)],5)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,3),(1,2),(2,4),(3,4)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => 3
([(0,4),(1,2),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,4),(4,5),(5,1),(5,2),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,5),(1,5),(2,5),(3,4),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
Description
The number of peaks of a Dyck path.
Matching statistic: St000676
Mapping
Mp00307: Posets —promotion cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000676: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([],2)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([],3)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,1),(0,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,2),(2,1)],3)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,1),(0,2),(0,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,2),(0,3),(3,1)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(1,2),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 4
([(0,3),(3,1),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,3),(1,3),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,3),(1,2)],4)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => 3
([(0,3),(1,2),(1,3)],4)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,3),(2,1),(3,2)],4)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,1),(0,2),(0,3),(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]
 => 4
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => 3
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,4),(4,1),(4,2),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,4),(1,4),(4,2),(4,3)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,4),(1,4),(2,4),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,4),(1,4),(2,3),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,4),(1,2),(1,4),(2,3)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => [1,0,1,0,1,0,1,1,0,1,0,0]
 => 4
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 2
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,2),(0,4),(3,1),(4,3)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 4
([(0,4),(1,2),(1,3),(3,4)],5)
 => [4,4,3]
 => [1,1,1,0,0,0,1,0,1,1,0,0]
 => [1,0,1,0,1,1,0,1,0,0,1,0]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
 => [5,3]
 => [1,1,1,1,0,0,0,1,0,0,1,0]
 => [1,0,1,0,1,1,1,0,0,1,0,0]
 => 4
([(0,3),(1,2),(1,4),(3,4)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => [1,0,1,0,1,0,1,1,0,1,0,0]
 => 4
([(1,4),(3,2),(4,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]
 => 5
([(0,3),(3,4),(4,1),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,4),(1,2),(2,4),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,4),(3,2),(4,1),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,4),(2,3),(3,1),(4,2)],5)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,3),(1,2),(2,4),(3,4)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,0,1,1,1,0,0,1,0,0]
 => 3
([(0,4),(1,2),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,4),(4,5),(5,1),(5,2),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,5),(1,5),(2,5),(3,4),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
Description
The number of odd rises of a Dyck path. This is the number of ones at an odd position, with the initial position equal to 1. The number of Dyck paths of semilength $n$ with $k$ up steps in odd positions and $k$ returns to the main diagonal are counted by the binomial coefficient $\binom{n-1}{k-1}$ [3,4].
Matching statistic: St001068
(load all 4 compositions to match this statistic)
Mapping
Mp00307: Posets —promotion cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St001068: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([],2)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([],3)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,1),(0,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,2),(2,1)],3)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,1),(0,2),(0,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,2),(0,3),(3,1)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(1,2),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => 4
([(0,3),(3,1),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,3),(1,3),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,3),(1,2)],4)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => 3
([(0,3),(1,2),(1,3)],4)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,3),(2,1),(3,2)],4)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => 3
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,0]
 => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,4),(4,1),(4,2),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,4),(1,4),(4,2),(4,3)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,4),(1,4),(2,4),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,4),(1,4),(2,3),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,4),(1,2),(1,4),(2,3)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,1,0,0,0]
 => 4
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,0]
 => 2
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,2),(0,4),(3,1),(4,3)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => 4
([(0,4),(1,2),(1,3),(3,4)],5)
 => [4,4,3]
 => [1,1,1,0,0,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
 => [5,3]
 => [1,1,1,1,0,0,0,1,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,1,0,0]
 => 4
([(0,3),(1,2),(1,4),(3,4)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => [1,0,1,0,1,1,1,0,1,0,0,0]
 => 4
([(1,4),(3,2),(4,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,1,0,0]
 => 5
([(0,3),(3,4),(4,1),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,4),(1,2),(2,4),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,4),(3,2),(4,1),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,1,0,1,0,0]
 => 3
([(0,4),(2,3),(3,1),(4,2)],5)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,3),(1,2),(2,4),(3,4)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => 3
([(0,4),(1,2),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,0]
 => 3
([(0,4),(4,5),(5,1),(5,2),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
([(0,5),(1,5),(2,5),(3,4),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
Description
Number of torsionless simple modules in the corresponding Nakayama algebra.
Matching statistic: St001203
Mapping
Mp00307: Posets —promotion cycle type⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001203: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([],2)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([],3)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,1),(0,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,2),(2,1)],3)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,1),(0,2),(0,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,2),(0,3),(3,1)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,1),(0,2),(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(1,2),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 4
([(0,3),(3,1),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,3),(1,3),(3,2)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,3),(1,3),(2,3)],4)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,3),(1,2)],4)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => 3
([(0,3),(1,2),(1,3)],4)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,3),(2,1),(3,2)],4)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,1),(0,2),(0,3),(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]
 => 4
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,3),(0,4),(3,2),(4,1)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => 3
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => 2
([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,4),(4,1),(4,2),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,4),(1,4),(4,2),(4,3)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,4),(1,4),(2,4),(4,3)],5)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,4),(1,4),(2,3),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,4),(1,2),(1,4),(2,3)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => [1,0,1,0,1,0,1,1,1,0,0,0]
 => 4
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,0,1,1,1,0,0,0]
 => 2
([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,2),(0,4),(3,1),(4,3)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 4
([(0,4),(1,2),(1,3),(3,4)],5)
 => [4,4,3]
 => [1,1,1,0,0,0,1,0,1,1,0,0]
 => [1,0,1,0,1,1,1,0,0,0,1,0]
 => 4
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
 => [5,3]
 => [1,1,1,1,0,0,0,1,0,0,1,0]
 => [1,0,1,0,1,1,0,1,1,0,0,0]
 => 4
([(0,3),(1,2),(1,4),(3,4)],5)
 => [5,4]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => [1,0,1,0,1,0,1,1,1,0,0,0]
 => 4
([(1,4),(3,2),(4,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]
 => 5
([(0,3),(3,4),(4,1),(4,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,4),(1,2),(2,4),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,4),(3,2),(4,1),(4,3)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,0,1,0,1,1,0,0]
 => 3
([(0,4),(2,3),(3,1),(4,2)],5)
 => [1]
 => [1,0,1,0]
 => [1,1,0,0]
 => 1
([(0,3),(1,2),(2,4),(3,4)],5)
 => [4,2]
 => [1,1,1,0,0,1,0,0,1,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => 3
([(0,4),(1,2),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,0,1,1,0,0]
 => 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,3),(0,4),(3,5),(4,5),(5,1),(5,2)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
([(0,4),(4,5),(5,1),(5,2),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
([(0,5),(1,5),(2,5),(3,4),(5,3)],6)
 => [3,3]
 => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,0,1,1,0,0,1,0]
 => 4
Description
We associate to 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 Dyck path as follows: In the list $L$ delete the first entry $c_0$ and substract from all other entries $n-1$ and then append the last element 1 (this was suggested by Christian Stump). The result is a Kupisch series of an LNakayama algebra. Example: [5,6,6,6,6] goes into [2,2,2,2,1]. Now associate to the CNakayama algebra with the above properties the Dyck path corresponding to the Kupisch series of the LNakayama algebra. The statistic return the global dimension of the CNakayama algebra divided by 2.
The following 125 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000053The number of valleys of the Dyck path. St000306The bounce count of a Dyck path. St000331The number of upper interactions of a Dyck path. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001621The number of atoms of a lattice. St001875The number of simple modules with projective dimension at most 1. St000264The girth of a graph, which is not a tree. St001060The distinguishing index of a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. 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. 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. St000460The hook length of the last cell along the main diagonal of an integer partition. St000618The number of self-evacuating tableaux of given shape. 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. St000781The number of proper colouring schemes of a Ferrers diagram. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the 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. St001360The number of covering relations in Young's lattice below a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001383The BG-rank of an integer partition. St001389The number of partitions of the same length below the given integer partition. 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. St001525The number of symmetric hooks on the diagonal of a partition. St001527The cyclic permutation representation number of an integer partition. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St001561The value of the elementary symmetric function evaluated at 1. 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. St001571The Cartan determinant of the integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. 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. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001763The Hurwitz number of an integer partition. St001780The order of promotion on the set of standard tableaux of given shape. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a 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. 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. St001914The size of the orbit 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. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001943The sum of the squares of the hook lengths of an integer partition. St000145The Dyson rank of a partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000944The 3-degree of an integer partition. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001280The number of parts of an integer partition that are at least two. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001541The Gini index of an integer partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001587Half of the largest even part of an integer partition. St001657The number of twos in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001961The sum of the greatest common divisors of all pairs of parts. St000474Dyson's crank of a partition. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St000456The monochromatic index of a connected graph. St001271The competition number of a graph. St001725The harmonious chromatic number of a graph. St000362The size of a minimal vertex cover of a graph. St000387The matching number of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001305The number of induced cycles on four vertices in a graph. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001883The mutual visibility number of a graph. St001877Number of indecomposable injective modules with projective dimension 2. St001876The number of 2-regular simple modules in the incidence algebra of the lattice.