Identifier
-
Mp00275:
Graphs
—to edge-partition of connected components⟶
Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00123: Dyck paths —Barnabei-Castronuovo involution⟶ Dyck paths
St001234: Dyck paths ⟶ ℤ (values match St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension.)
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,0,1,1,0,0] => 0
([(0,1),(0,2),(1,2)],3) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(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,0,1,1,0,0] => 0
([(0,3),(1,3),(2,3)],4) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(0,3),(1,2)],4) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 0
([(0,3),(1,2),(2,3)],4) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(1,2),(1,3),(2,3)],4) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(0,3),(1,2),(1,3),(2,3)],4) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(0,2),(0,3),(1,2),(1,3)],4) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 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,0,1,1,0,0] => 0
([(1,4),(2,4),(3,4)],5) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(0,4),(1,4),(2,4),(3,4)],5) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(1,4),(2,3)],5) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 0
([(1,4),(2,3),(3,4)],5) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(0,1),(2,4),(3,4)],5) => [2,1] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 0
([(2,3),(2,4),(3,4)],5) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(0,4),(1,4),(2,3),(3,4)],5) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(1,4),(2,3),(2,4),(3,4)],5) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(1,3),(1,4),(2,3),(2,4)],5) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 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,0,1,1,1,1,1,0,0,0,0,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,0,1,1,1,1,1,0,0,0,0,0] => 2
([(0,4),(1,3),(2,3),(2,4)],5) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(0,1),(2,3),(2,4),(3,4)],5) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 0
([(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,0,1,1,1,1,1,0,0,0,0,0] => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 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,0,1,1,0,0] => 0
([(2,5),(3,5),(4,5)],6) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(1,5),(2,5),(3,5),(4,5)],6) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(2,5),(3,4)],6) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 0
([(2,5),(3,4),(4,5)],6) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(1,2),(3,5),(4,5)],6) => [2,1] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 0
([(3,4),(3,5),(4,5)],6) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(1,5),(2,5),(3,4),(4,5)],6) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(0,1),(2,5),(3,5),(4,5)],6) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 0
([(2,5),(3,4),(3,5),(4,5)],6) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 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,0,1,1,1,1,1,0,0,0,0,0] => 2
([(2,4),(2,5),(3,4),(3,5)],6) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(0,5),(1,5),(2,4),(3,4)],6) => [2,2] => [1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => 0
([(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,0,1,1,1,1,1,0,0,0,0,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,0,1,1,1,1,1,0,0,0,0,0] => 2
([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(1,5),(2,4),(3,4),(3,5),(4,5)],6) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(0,5),(1,5),(2,4),(3,4),(4,5)],6) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(0,5),(1,4),(2,3)],6) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,0] => 1
([(1,5),(2,4),(3,4),(3,5)],6) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(0,1),(2,5),(3,4),(4,5)],6) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 0
([(1,2),(3,4),(3,5),(4,5)],6) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 0
([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(1,4),(2,3),(2,5),(3,5),(4,5)],6) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(0,1),(2,5),(3,4),(3,5),(4,5)],6) => [4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(0,1),(2,4),(2,5),(3,4),(3,5)],6) => [4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 0
([(0,5),(1,5),(2,3),(2,4),(3,4)],6) => [3,2] => [1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => 0
([(0,1),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 1
([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6) => [3,3] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 0
([(5,6)],7) => [1] => [1,0,1,0] => [1,0,1,0] => 0
([(4,6),(5,6)],7) => [2] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => 0
([(3,6),(4,6),(5,6)],7) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(2,6),(3,6),(4,6),(5,6)],7) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(1,6),(2,6),(3,6),(4,6),(5,6)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(3,6),(4,5)],7) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 0
([(3,6),(4,5),(5,6)],7) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(2,3),(4,6),(5,6)],7) => [2,1] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 0
([(4,5),(4,6),(5,6)],7) => [3] => [1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => 0
([(2,6),(3,6),(4,5),(5,6)],7) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(1,2),(3,6),(4,6),(5,6)],7) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 0
([(3,6),(4,5),(4,6),(5,6)],7) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(1,6),(2,6),(3,6),(4,5),(5,6)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(0,1),(2,6),(3,6),(4,6),(5,6)],7) => [4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 0
([(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(3,5),(3,6),(4,5),(4,6)],7) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(1,6),(2,6),(3,5),(4,5)],7) => [2,2] => [1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => 0
([(2,6),(3,4),(3,5),(4,6),(5,6)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(1,6),(2,6),(3,4),(4,5),(5,6)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(0,6),(1,6),(2,6),(3,5),(4,5)],7) => [3,2] => [1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => 0
([(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(2,6),(3,5),(4,5),(4,6),(5,6)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(1,6),(2,6),(3,5),(4,5),(5,6)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(1,6),(2,5),(3,4)],7) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,0] => 1
([(2,6),(3,5),(4,5),(4,6)],7) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 1
([(1,2),(3,6),(4,5),(5,6)],7) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 0
([(0,3),(1,2),(4,6),(5,6)],7) => [2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,1,0,0,1,0,0] => 1
([(2,3),(4,5),(4,6),(5,6)],7) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => 0
([(1,6),(2,5),(3,4),(4,6),(5,6)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(0,1),(2,6),(3,6),(4,5),(5,6)],7) => [4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 0
([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(1,2),(3,6),(4,5),(4,6),(5,6)],7) => [4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 0
([(0,1),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 1
([(2,5),(2,6),(3,4),(3,6),(4,5)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
([(1,6),(2,5),(3,4),(3,5),(4,6)],7) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 2
>>> Load all 120 entries. <<<
search for individual values
searching the database for the individual values of this statistic
Description
The number of indecomposable three dimensional modules with projective dimension one.
It return zero when there are no such modules.
It return zero when there are no such modules.
Map
Barnabei-Castronuovo involution
Description
The Barnabei-Castronuovo Schützenberger involution on Dyck paths.
The image of a Dyck path is obtained by reversing the canonical decompositions of the two halves of the Dyck path. More precisely, let $D_1, 1, D_2, 1, \dots$ be the canonical decomposition of the first half, then the canonical decomposition of the first half of the image is $\dots, 1, D_2, 1, D_1$.
The image of a Dyck path is obtained by reversing the canonical decompositions of the two halves of the Dyck path. More precisely, let $D_1, 1, D_2, 1, \dots$ be the canonical decomposition of the first half, then the canonical decomposition of the first half of the image is $\dots, 1, D_2, 1, D_1$.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
Map
to edge-partition of connected components
Description
Sends a graph to the partition recording the number of edges in its connected components.
searching the database
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!