Identifier
-
Mp00184:
Integer compositions
—to threshold graph⟶
Graphs
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
St000755: Integer partitions ⟶ ℤ
Values
[1,1] => ([(0,1)],2) => [1] => 1
[1,1,1] => ([(0,1),(0,2),(1,2)],3) => [3] => 1
[1,2] => ([(1,2)],3) => [1] => 1
[2,1] => ([(0,2),(1,2)],3) => [2] => 2
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [6] => 2
[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] => 2
[1,3] => ([(2,3)],4) => [1] => 1
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [5] => 1
[2,2] => ([(1,3),(2,3)],4) => [2] => 2
[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] => 2
[1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [6] => 2
[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] => 2
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => [4] => 2
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => [5] => 1
[1,4] => ([(3,4)],5) => [1] => 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] => 2
[2,3] => ([(2,4),(3,4)],5) => [2] => 2
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[1,5] => ([(4,5)],6) => [1] => 1
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [6] => 2
[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] => 2
[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] => 2
[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] => 2
[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] => 2
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7) => [4] => 2
[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] => 2
[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] => 2
[1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [6] => 2
[1,5,1] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [7] => 1
[1,6] => ([(5,6)],7) => [1] => 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] => 2
[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] => 2
[2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [6] => 2
[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] => 2
[2,5] => ([(4,6),(5,6)],7) => [2] => 2
[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] => 2
[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] => 2
[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] => 2
[4,3] => ([(2,6),(3,6),(4,6),(5,6)],7) => [4] => 2
[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] => 2
search for individual values
searching the database for the individual values of this statistic
Description
The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition.
Consider the recurrence $$f(n)=\sum_{p\in\lambda} f(n-p).$$ This statistic returns the number of distinct real roots of the associated characteristic polynomial.
For example, the partition $(2,1)$ corresponds to the recurrence $f(n)=f(n-1)+f(n-2)$ with associated characteristic polynomial $x^2-x-1$, which has two real roots.
Consider the recurrence $$f(n)=\sum_{p\in\lambda} f(n-p).$$ This statistic returns the number of distinct real roots of the associated characteristic polynomial.
For example, the partition $(2,1)$ corresponds to the recurrence $f(n)=f(n-1)+f(n-2)$ with associated characteristic polynomial $x^2-x-1$, which has two real roots.
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.
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!