- FindStat

Identifier

Mp00075: Semistandard tableaux —reading word permutation⟶ Permutations
St000018: Permutations ⟶ ℤ

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 2457 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 inversions of a permutation.
This equals the minimal number of simple transpositions $(i,i+1)$ needed to write $\pi$. Thus, it is also the Coxeter length of $\pi$.

Map

reading word permutation

Description

Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottommost row (in English notation).