Identifier
Values
([(0,5),(1,5),(2,4),(3,4)],6) => [2,2] => [2] => 0
([(0,5),(1,4),(2,3)],6) => [1,1,1] => [1,1] => 1
([(0,5),(1,5),(2,3),(2,4),(3,4)],6) => [3,2] => [2] => 0
([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6) => [3,3] => [3] => 0
([(1,6),(2,6),(3,5),(4,5)],7) => [2,2] => [2] => 0
([(0,6),(1,6),(2,6),(3,5),(4,5)],7) => [3,2] => [2] => 0
([(1,6),(2,5),(3,4)],7) => [1,1,1] => [1,1] => 1
([(0,3),(1,2),(4,6),(5,6)],7) => [2,1,1] => [1,1] => 1
([(0,6),(1,5),(2,4),(3,4),(5,6)],7) => [3,2] => [2] => 0
([(1,6),(2,6),(3,4),(3,5),(4,5)],7) => [3,2] => [2] => 0
([(0,6),(1,3),(2,3),(4,5),(4,6),(5,6)],7) => [4,2] => [2] => 0
([(0,6),(1,6),(2,6),(3,4),(3,5),(4,5)],7) => [3,3] => [3] => 0
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5)],7) => [4,2] => [2] => 0
([(0,4),(1,4),(2,5),(2,6),(3,5),(3,6),(5,6)],7) => [5,2] => [2] => 0
([(0,3),(1,2),(4,5),(4,6),(5,6)],7) => [3,1,1] => [1,1] => 1
([(0,6),(1,5),(2,3),(2,4),(3,4),(5,6)],7) => [3,3] => [3] => 0
([(1,5),(1,6),(2,3),(2,4),(3,4),(5,6)],7) => [3,3] => [3] => 0
([(0,6),(1,2),(1,3),(2,3),(4,5),(4,6),(5,6)],7) => [4,3] => [3] => 0
([(0,5),(0,6),(1,2),(1,3),(2,3),(4,5),(4,6)],7) => [4,3] => [3] => 0
([(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [6,2] => [2] => 0
([(0,1),(0,2),(1,2),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [5,3] => [3] => 0
([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [6,3] => [3] => 0
search for individual values
searching the database for the individual values of this statistic
Description
The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees.
For a generating function $f$ the associated formal group law is the symmetric function $f(f^{(-1)}(x_1) + f^{(-1)}(x_2), \dots)$, see [1].
This statistic records the coefficient of the monomial symmetric function $m_\lambda$ times the product of the factorials of the parts of $\lambda$ in the formal group law for leaf labelled binary trees, whose generating function is the reversal of $f^{(-1)}(x) = 1+2x-\exp(x)$, see [1, sec. 3.2]
Fix a set of distinguishable vertices and a coloring of the vertices so that $\lambda_i$ are colored $i$. This statistic gives the number of rooted trees with leaves labeled with this set of vertices and internal vertices unlabeled so that no pair of 'twin' leaves have the same color.
Map
first row removal
Description
Removes the first entry of an integer partition
Map
to edge-partition of connected components
Description
Sends a graph to the partition recording the number of edges in its connected components.