- FindStat

Identifier

Mp00225: Semistandard tableaux —weight⟶ Integer partitions
Mp00322: Integer partitions —Loehr-Warrington⟶ Integer partitions
St001710: Integer partitions ⟶ ℤ

Values

[[1,2]] => [1,1] => [2] => 2

[[2,2]] => [2] => [1,1] => 2

[[1],[2]] => [1,1] => [2] => 2

[[1,3]] => [1,1] => [2] => 2

[[2,3]] => [1,1] => [2] => 2

[[3,3]] => [2] => [1,1] => 2

[[1],[3]] => [1,1] => [2] => 2

[[2],[3]] => [1,1] => [2] => 2

[[1,1,2]] => [2,1] => [3] => 1

[[1,2,2]] => [2,1] => [3] => 1

[[2,2,2]] => [3] => [1,1,1] => 4

[[1,1],[2]] => [2,1] => [3] => 1

[[1,2],[2]] => [2,1] => [3] => 1

[[1,4]] => [1,1] => [2] => 2

[[2,4]] => [1,1] => [2] => 2

[[3,4]] => [1,1] => [2] => 2

[[4,4]] => [2] => [1,1] => 2

[[1],[4]] => [1,1] => [2] => 2

[[2],[4]] => [1,1] => [2] => 2

[[3],[4]] => [1,1] => [2] => 2

[[1,1,3]] => [2,1] => [3] => 1

[[1,2,3]] => [1,1,1] => [2,1] => 4

[[1,3,3]] => [2,1] => [3] => 1

[[2,2,3]] => [2,1] => [3] => 1

[[2,3,3]] => [2,1] => [3] => 1

[[3,3,3]] => [3] => [1,1,1] => 4

[[1,1],[3]] => [2,1] => [3] => 1

[[1,2],[3]] => [1,1,1] => [2,1] => 4

[[1,3],[2]] => [1,1,1] => [2,1] => 4

[[1,3],[3]] => [2,1] => [3] => 1

[[2,2],[3]] => [2,1] => [3] => 1

[[2,3],[3]] => [2,1] => [3] => 1

[[1],[2],[3]] => [1,1,1] => [2,1] => 4

[[1,1,1,2]] => [3,1] => [2,1,1] => 10

[[1,1,2,2]] => [2,2] => [4] => 2

[[1,2,2,2]] => [3,1] => [2,1,1] => 10

[[2,2,2,2]] => [4] => [1,1,1,1] => 10

[[1,1,1],[2]] => [3,1] => [2,1,1] => 10

[[1,1,2],[2]] => [2,2] => [4] => 2

[[1,2,2],[2]] => [3,1] => [2,1,1] => 10

[[1,1],[2,2]] => [2,2] => [4] => 2

[[1,5]] => [1,1] => [2] => 2

[[2,5]] => [1,1] => [2] => 2

[[3,5]] => [1,1] => [2] => 2

[[4,5]] => [1,1] => [2] => 2

[[5,5]] => [2] => [1,1] => 2

[[1],[5]] => [1,1] => [2] => 2

[[2],[5]] => [1,1] => [2] => 2

[[3],[5]] => [1,1] => [2] => 2

[[4],[5]] => [1,1] => [2] => 2

[[1,1,4]] => [2,1] => [3] => 1

[[1,2,4]] => [1,1,1] => [2,1] => 4

[[1,3,4]] => [1,1,1] => [2,1] => 4

[[1,4,4]] => [2,1] => [3] => 1

[[2,2,4]] => [2,1] => [3] => 1

[[2,3,4]] => [1,1,1] => [2,1] => 4

[[2,4,4]] => [2,1] => [3] => 1

[[3,3,4]] => [2,1] => [3] => 1

[[3,4,4]] => [2,1] => [3] => 1

[[4,4,4]] => [3] => [1,1,1] => 4

[[1,1],[4]] => [2,1] => [3] => 1

[[1,2],[4]] => [1,1,1] => [2,1] => 4

[[1,4],[2]] => [1,1,1] => [2,1] => 4

[[1,3],[4]] => [1,1,1] => [2,1] => 4

[[1,4],[3]] => [1,1,1] => [2,1] => 4

[[1,4],[4]] => [2,1] => [3] => 1

[[2,2],[4]] => [2,1] => [3] => 1

[[2,3],[4]] => [1,1,1] => [2,1] => 4

[[2,4],[3]] => [1,1,1] => [2,1] => 4

[[2,4],[4]] => [2,1] => [3] => 1

[[3,3],[4]] => [2,1] => [3] => 1

[[3,4],[4]] => [2,1] => [3] => 1

[[1],[2],[4]] => [1,1,1] => [2,1] => 4

[[1],[3],[4]] => [1,1,1] => [2,1] => 4

[[2],[3],[4]] => [1,1,1] => [2,1] => 4

[[1,1,1,3]] => [3,1] => [2,1,1] => 10

[[1,1,2,3]] => [2,1,1] => [2,2] => 10

[[1,1,3,3]] => [2,2] => [4] => 2

[[1,2,2,3]] => [2,1,1] => [2,2] => 10

[[1,2,3,3]] => [2,1,1] => [2,2] => 10

[[1,3,3,3]] => [3,1] => [2,1,1] => 10

[[2,2,2,3]] => [3,1] => [2,1,1] => 10

[[2,2,3,3]] => [2,2] => [4] => 2

[[2,3,3,3]] => [3,1] => [2,1,1] => 10

[[3,3,3,3]] => [4] => [1,1,1,1] => 10

[[1,1,1],[3]] => [3,1] => [2,1,1] => 10

[[1,1,2],[3]] => [2,1,1] => [2,2] => 10

[[1,1,3],[2]] => [2,1,1] => [2,2] => 10

[[1,1,3],[3]] => [2,2] => [4] => 2

[[1,2,2],[3]] => [2,1,1] => [2,2] => 10

[[1,2,3],[2]] => [2,1,1] => [2,2] => 10

[[1,2,3],[3]] => [2,1,1] => [2,2] => 10

[[1,3,3],[2]] => [2,1,1] => [2,2] => 10

[[1,3,3],[3]] => [3,1] => [2,1,1] => 10

[[2,2,2],[3]] => [3,1] => [2,1,1] => 10

[[2,2,3],[3]] => [2,2] => [4] => 2

[[2,3,3],[3]] => [3,1] => [2,1,1] => 10

[[1,1],[2,3]] => [2,1,1] => [2,2] => 10

[[1,1],[3,3]] => [2,2] => [4] => 2

[[1,2],[2,3]] => [2,1,1] => [2,2] => 10

[[1,2],[3,3]] => [2,1,1] => [2,2] => 10

>>> Load all 2460 entries. <<<

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 permutations such that conjugation with a permutation of given cycle type yields the inverse permutation.
Let $\alpha$ be any permutation of cycle type $\lambda$. This statistic is the number of permutations $\pi$ such that
$$ \alpha\pi\alpha^{-1} = \pi^{-1}.$$

Map

Loehr-Warrington

Description

Return a partition whose diagonal inversion number is the length of the preimage.

Map

weight

Description

The weight of a semistandard tableau as an integer partition.
The weight (or content) of a semistandard tableaux $T$ with maximal entry $m$ is the weak composition $(\alpha_1, \dots, \alpha_m)$ such that $\alpha_i$ is the number of letters $i$ occurring in $T$.
This map returns the integer partition obtained by sorting the weight into decreasing order and omitting zeros.
Since semistandard tableaux are bigraded by the size of the partition and the maximal occurring entry, this map is not graded.