Identifier
-
Mp00184:
Integer compositions
—to threshold graph⟶
Graphs
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
St000620: Integer partitions ⟶ ℤ
Values
[1,1,1] => ([(0,1),(0,2),(1,2)],3) => [3] => 1
[2,1] => ([(0,2),(1,2)],3) => [2] => 0
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [6] => 0
[1,1,2] => ([(1,2),(1,3),(2,3)],4) => [3] => 1
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => [4] => 0
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [5] => 1
[2,2] => ([(1,3),(2,3)],4) => [2] => 0
[3,1] => ([(0,3),(1,3),(2,3)],4) => [3] => 1
[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) => [10] => 0
[1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [6] => 0
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [7] => 1
[1,1,3] => ([(2,3),(2,4),(3,4)],5) => [3] => 1
[1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [8] => 0
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => [4] => 0
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => [5] => 1
[2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [9] => 1
[2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [5] => 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [6] => 0
[2,3] => ([(2,4),(3,4)],5) => [2] => 0
[3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [7] => 1
[3,2] => ([(1,4),(2,4),(3,4)],5) => [3] => 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => [4] => 0
[1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [10] => 0
[1,1,1,2,1] => ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [11] => 1
[1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [6] => 0
[1,1,2,1,1] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [12] => 0
[1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [7] => 1
[1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [8] => 0
[1,1,4] => ([(3,4),(3,5),(4,5)],6) => [3] => 1
[1,2,1,2] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [8] => 0
[1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [9] => 1
[1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6) => [4] => 0
[1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [10] => 0
[1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => [5] => 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => [6] => 0
[2,1,1,2] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [9] => 1
[2,1,2,1] => ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [10] => 0
[2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5] => 1
[2,2,1,1] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [11] => 1
[2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [6] => 0
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [7] => 1
[2,4] => ([(3,5),(4,5)],6) => [2] => 0
[3,1,1,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [12] => 0
[3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [7] => 1
[3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [8] => 0
[3,3] => ([(2,5),(3,5),(4,5)],6) => [3] => 1
[4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [9] => 1
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6) => [4] => 0
[5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => [5] => 1
[1,1,1,1,3] => ([(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [10] => 0
[1,1,1,2,2] => ([(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [11] => 1
[1,1,1,3,1] => ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [12] => 0
[1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [6] => 0
[1,1,2,1,2] => ([(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [12] => 0
[1,1,2,3] => ([(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [7] => 1
[1,1,3,2] => ([(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [8] => 0
[1,1,4,1] => ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [9] => 1
[1,1,5] => ([(4,5),(4,6),(5,6)],7) => [3] => 1
[1,2,1,3] => ([(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [8] => 0
[1,2,2,2] => ([(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [9] => 1
[1,2,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [10] => 0
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7) => [4] => 0
[1,3,1,2] => ([(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [10] => 0
[1,3,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [11] => 1
[1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [5] => 1
[1,4,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [12] => 0
[1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [6] => 0
[1,5,1] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [7] => 1
[2,1,1,3] => ([(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [9] => 1
[2,1,2,2] => ([(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [10] => 0
[2,1,3,1] => ([(0,6),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [11] => 1
[2,1,4] => ([(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [5] => 1
[2,2,1,2] => ([(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [11] => 1
[2,2,2,1] => ([(0,6),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [12] => 0
[2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [6] => 0
[2,3,2] => ([(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [7] => 1
[2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [8] => 0
[2,5] => ([(4,6),(5,6)],7) => [2] => 0
[3,1,1,2] => ([(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [12] => 0
[3,1,3] => ([(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [7] => 1
[3,2,2] => ([(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [8] => 0
[3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [9] => 1
[3,4] => ([(3,6),(4,6),(5,6)],7) => [3] => 1
[4,1,2] => ([(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [9] => 1
[4,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [10] => 0
[4,3] => ([(2,6),(3,6),(4,6),(5,6)],7) => [4] => 0
[5,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [11] => 1
[5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7) => [5] => 1
[6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => [6] => 0
search for individual values
searching the database for the individual values of this statistic
Description
The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd.
To be precise, this is given for a partition $\lambda \vdash n$ by the number of standard tableaux $T$ of shape $\lambda$ such that $\min\big( \operatorname{Des}(T) \cup \{n\} \big)$ is odd.
The case of an even minimum is St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even..
To be precise, this is given for a partition $\lambda \vdash n$ by the number of standard tableaux $T$ of shape $\lambda$ such that $\min\big( \operatorname{Des}(T) \cup \{n\} \big)$ is odd.
The case of an even minimum is St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even..
Map
to edge-partition of connected components
Description
Sends a graph to the partition recording the number of edges in its connected components.
Map
to threshold graph
Description
The threshold graph corresponding to the composition.
A threshold graph is a graph that can be obtained from the empty graph by adding successively isolated and dominating vertices.
A threshold graph is uniquely determined by its degree sequence.
The Laplacian spectrum of a threshold graph is integral. Interpreting it as an integer partition, it is the conjugate of the partition given by its degree sequence.
A threshold graph is a graph that can be obtained from the empty graph by adding successively isolated and dominating vertices.
A threshold graph is uniquely determined by its degree sequence.
The Laplacian spectrum of a threshold graph is integral. Interpreting it as an integer partition, it is the conjugate of the partition given by its degree sequence.
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!