Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001508
Mapping
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
St001508: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
 => [1]
 => [1,0,1,0]
 => [1,0,1,0]
 => 0
([(1,2)],3)
 => [1]
 => [1,0,1,0]
 => [1,0,1,0]
 => 0
([(0,2),(1,2)],3)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,0,1,0]
 => 1
([(0,1),(0,2),(1,2)],3)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 1
([(2,3)],4)
 => [1]
 => [1,0,1,0]
 => [1,0,1,0]
 => 0
([(1,3),(2,3)],4)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,0,1,0]
 => 1
([(0,3),(1,3),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 1
([(0,3),(1,2)],4)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => 2
([(0,3),(1,2),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 1
([(1,2),(1,3),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
([(0,2),(0,3),(1,2),(1,3)],4)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
([(3,4)],5)
 => [1]
 => [1,0,1,0]
 => [1,0,1,0]
 => 0
([(2,4),(3,4)],5)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,0,1,0]
 => 1
([(1,4),(2,4),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
([(1,4),(2,3)],5)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => 2
([(1,4),(2,3),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 1
([(0,1),(2,4),(3,4)],5)
 => [2,1]
 => [1,0,1,0,1,0]
 => [1,0,1,0,1,0]
 => 0
([(2,3),(2,4),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
([(4,5)],6)
 => [1]
 => [1,0,1,0]
 => [1,0,1,0]
 => 0
([(3,5),(4,5)],6)
 => [2]
 => [1,1,0,0,1,0]
 => [1,1,0,0,1,0]
 => 1
([(2,5),(3,5),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 1
([(1,5),(2,5),(3,5),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
([(2,5),(3,4)],6)
 => [1,1]
 => [1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => 2
([(2,5),(3,4),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 1
([(1,2),(3,5),(4,5)],6)
 => [2,1]
 => [1,0,1,0,1,0]
 => [1,0,1,0,1,0]
 => 0
([(3,4),(3,5),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 1
([(1,5),(2,5),(3,4),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
([(0,1),(2,5),(3,5),(4,5)],6)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => [1,0,1,1,0,0,1,0]
 => 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
([(2,4),(2,5),(3,4),(3,5)],6)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
([(0,5),(1,5),(2,4),(3,4)],6)
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,1,1,0,0,1,0,0]
 => 2
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => [5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
Description
The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. Given two lattice paths $U,L$ from $(0,0)$ to $(d,n-d)$, [1] describes a bijection between lattice paths weakly between $U$ and $L$ and subsets of $\{1,\dots,n\}$ such that the set of all such subsets gives the standard complex of the lattice path matroid $M[U,L]$. This statistic gives the cardinality of the image of this bijection when a Dyck path is considered as a path weakly above the diagonal and relative to the diagonal boundary.