Identifier
Values
['A',1] => ([],1) => [1] => [1] => 0
['A',2] => ([(0,2),(1,2)],3) => [2,1] => [1,1,1] => 0
['B',2] => ([(0,3),(1,3),(3,2)],4) => [3,1] => [3,1] => 1
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => [5,1] => [5,1] => 1
['A',3] => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6) => [3,2,1] => [3,1,1,1] => 4
['B',3] => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9) => [5,3,1] => [5,3,1] => 54
['C',3] => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9) => [5,3,1] => [5,3,1] => 54
['A',4] => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10) => [4,3,2,1] => [3,1,1,1,1,1,1,1] => 16
['D',4] => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12) => [5,3,3,1] => [6,5,1] => 378
search for individual values
searching the database for the individual values of this statistic
/ search for generating function
searching the database for statistics with the same generating function
click to show known generating functions       
Description
The number of standard desarrangement tableaux of shape equal to the given partition.
A standard desarrangement tableau is a standard tableau whose first ascent is even. Here, an ascent of a standard tableau is an entry $i$ such that $i+1$ appears to the right or above $i$ in the tableau (with respect to English tableau notation).
This is also the nullity of the random-to-random operator (and the random-to-top) operator acting on the simple module of the symmetric group indexed by the given partition. See also:
  • St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition.: The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition
  • St000500Eigenvalues of the random-to-random operator acting on the regular representation.: Eigenvalues of the random-to-random operator acting on the regular representation.
Map
Glaisher-Franklin inverse
Description
The Glaisher-Franklin bijection on integer partitions.
This map sends the number of distinct repeated part sizes to the number of distinct even part sizes, see [1, 3.3.1].
Map
to root poset
Description
The root poset of a finite Cartan type.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
Map
Greene-Kleitman invariant
Description
The Greene-Kleitman invariant of a poset.
This is the partition $(c_1 - c_0, c_2 - c_1, c_3 - c_2, \ldots)$, where $c_k$ is the maximum cardinality of a union of $k$ chains of the poset. Equivalently, this is the conjugate of the partition $(a_1 - a_0, a_2 - a_1, a_3 - a_2, \ldots)$, where $a_k$ is the maximum cardinality of a union of $k$ antichains of the poset.