- FindStat

Identifier

Mp00075: Semistandard tableaux —reading word permutation⟶ Permutations
Mp00062: Permutations —Lehmer-code to major-code bijection⟶ Permutations
Mp00066: Permutations —inverse⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words

Images

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 2463 entries. <<<

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).

Map

Lehmer-code to major-code bijection

Description

Sends a permutation to the unique permutation such that the Lehmer code is sent to the major code.
The Lehmer code encodes the inversions of a permutation and the major code encodes its major index. In particular, the number of inversions of a permutation equals the major index of its image under this map.
* The Lehmer code of a permutation $\sigma$ is given by $L(\sigma) = l_1 \ldots l_n$ with $l_i = \# \{ j > i : \sigma_j < \sigma_i \}$. In particular, $l_i$ is the number of boxes in the $i$-th column of the Rothe diagram. For example, the Lehmer code of $\sigma = [4,3,1,5,2]$ is $32010$. The Lehmer code $L : \mathfrak{S}_n\ \tilde\longrightarrow\ S_n$ is a bijection between permutations of size $n$ and sequences $l_1\ldots l_n \in \mathbf{N}^n$ with $l_i \leq i$.
* The major code $M(\sigma)$ of a permutation $\sigma \in \mathfrak{S}_n$ is a way to encode a permutation as a sequence $m_1 m_2 \ldots m_n$ with $m_i \geq i$. To define $m_i$, let $\operatorname{del}_i(\sigma)$ be the normalized permutation obtained by removing all $\sigma_j < i$ from the one-line notation of $\sigma$. The $i$-th index is then given by
$$m_i = \operatorname{maj}(\operatorname{del}_i(\sigma)) - \operatorname{maj}(\operatorname{del}_{i-1}(\sigma)).$$
For example, the permutation $[9,3,5,7,2,1,4,6,8]$ has major code $[5, 0, 1, 0, 1, 2, 0, 1, 0]$ since
$$\operatorname{maj}([8,2,4,6,1,3,5,7]) = 5, \quad \operatorname{maj}([7,1,3,5,2,4,6]) = 5, \quad \operatorname{maj}([6,2,4,1,3,5]) = 4,$$
$$\operatorname{maj}([5,1,3,2,4]) = 4, \quad \operatorname{maj}([4,2,1,3]) = 3, \quad \operatorname{maj}([3,1,2]) = 1, \quad \operatorname{maj}([2,1]) = 1.$$
Observe that the sum of the major code of $\sigma$ equals the major index of $\sigma$.

Map

inverse

Description

Sends a permutation to its inverse.

Map

descent word

Description

The descent positions of a permutation as a binary word.
For a permutation $\pi$ of $n$ letters and each $1\leq i\leq n-1$ such that $\pi(i) > \pi(i+1)$ we set $w_i=1$, otherwise $w_i=0$.
Thus, the length of the word is one less the size of the permutation. In particular, the descent word is undefined for the empty permutation.