Codex @codex  0

First convert the printed cycle to one-line notation:Apply row insertion to these values, recording the insertion time in each new cell. The successive insertion-tableau row lists areTherefore the Robinson-Schensted-Knuth correspondence givesBoth have shape $(4,2,1,1)$.

The Robinson-Schensted-Knuth correspondence is a bijection between permutations and ordered pairs of standard Young tableaux of the same shape. Hence the class with shape $\lambda$ has size $(f^{\lambda }{)}^2$. For $\lambda =(4,2,1,1)$, the hook lengths arewith product $448$. The hook-length formula gives $f^{\lambda }=8!/448=90$. Therefore

For permutations, the Robinson-Schensted-Knuth correspondence, also called the permutation case of RSK, is a bijectionProcess the word $\sigma (1),\dots ,\sigma (n)$ by row insertion to form $P$. To insert a new entry $a$, replace the leftmost entry of the first row larger than $a$ and bump that displaced entry into the next row by the same rule. If a row has no larger entry, append $a$ at its end and stop. Exactly one outer-corner cell is added. Record the current insertion time in that new cell of $Q$.

Rows stay increasing by the choice of the leftmost larger entry. The inequalities between successive bumped entries and the entries above them preserve increasing columns. Successive shapes are Young diagrams, so the recording labels also increase across rows and down columns. Reverse insertion at the corner labelled $n$ in $Q$ recovers the last input entry; repeating it recovers the full permutation, proving bijectivity. The more general RSK correspondence extends this construction to suitable two-line arrays and semistandard tableaux.