Identifier
Values
([(0,5),(1,5),(2,4),(3,4)],6) => [2,2] => [2] => [1,1] => 1
([(0,5),(1,4),(2,3)],6) => [1,1,1] => [1,1] => [2] => 2
([(0,5),(1,5),(2,3),(2,4),(3,4)],6) => [3,2] => [2] => [1,1] => 1
([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6) => [3,3] => [3] => [1,1,1] => 1
([(1,6),(2,6),(3,5),(4,5)],7) => [2,2] => [2] => [1,1] => 1
([(0,6),(1,6),(2,6),(3,5),(4,5)],7) => [3,2] => [2] => [1,1] => 1
([(1,6),(2,5),(3,4)],7) => [1,1,1] => [1,1] => [2] => 2
([(0,3),(1,2),(4,6),(5,6)],7) => [2,1,1] => [1,1] => [2] => 2
([(0,6),(1,5),(2,4),(3,4),(5,6)],7) => [3,2] => [2] => [1,1] => 1
([(1,6),(2,6),(3,4),(3,5),(4,5)],7) => [3,2] => [2] => [1,1] => 1
([(0,6),(1,3),(2,3),(4,5),(4,6),(5,6)],7) => [4,2] => [2] => [1,1] => 1
([(0,6),(1,6),(2,6),(3,4),(3,5),(4,5)],7) => [3,3] => [3] => [1,1,1] => 1
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5)],7) => [4,2] => [2] => [1,1] => 1
([(0,4),(1,4),(2,5),(2,6),(3,5),(3,6),(5,6)],7) => [5,2] => [2] => [1,1] => 1
([(0,3),(1,2),(4,5),(4,6),(5,6)],7) => [3,1,1] => [1,1] => [2] => 2
([(0,6),(1,5),(2,3),(2,4),(3,4),(5,6)],7) => [3,3] => [3] => [1,1,1] => 1
([(1,5),(1,6),(2,3),(2,4),(3,4),(5,6)],7) => [3,3] => [3] => [1,1,1] => 1
([(0,6),(1,2),(1,3),(2,3),(4,5),(4,6),(5,6)],7) => [4,3] => [3] => [1,1,1] => 1
([(0,5),(0,6),(1,2),(1,3),(2,3),(4,5),(4,6)],7) => [4,3] => [3] => [1,1,1] => 1
([(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [6,2] => [2] => [1,1] => 1
([(0,1),(0,2),(1,2),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [5,3] => [3] => [1,1,1] => 1
([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [6,3] => [3] => [1,1,1] => 1
search for individual values
searching the database for the individual values of this statistic
Description
The least common multiple of the parts of the partition.
Map
conjugate
Description
Return the conjugate partition of the partition.
The conjugate partition of the partition $\lambda$ of $n$ is the partition $\lambda^*$ whose Ferrers diagram is obtained from the diagram of $\lambda$ by interchanging rows with columns.
This is also called the associated partition or the transpose in the literature.
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.