Identifier
Values
['A',1] => ([],1) => [2] => [1,1] => 1
['A',2] => ([(0,2),(1,2)],3) => [3,2] => [2,2,1] => 3
['B',2] => ([(0,3),(1,3),(3,2)],4) => [4,2] => [2,2,1,1] => 6
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => [6,2] => [2,2,1,1,1,1] => 15
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 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..
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
rowmotion cycle type
Description
The cycle type of rowmotion on the order ideals of a poset.
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.