Trace the southeast boundary of the <Hook of a Young diagram> based at $(i,j)$. At each horizontal boundary step record the hook length $h_{i,y}$ of the cell in row $i$ above that step. At each vertical step ending beside row $x$, record $h_{i,j}-h_{x,j}$. Starting at the northeast end and moving to the southwest end, these records increase by one from $1$ to $h_{i,j}$; horizontal and vertical steps are disjoint and account for every step. Therefore the <Hook-interval decomposition at a Young-diagram cell> is
$$
\boxed{
\{1,\ldots,h_{i,j}\}
=\{h_{i,y}:j\leq y\leq\lambda_i\}
\sqcup
\{h_{i,j}-h_{x,j}:i<x\leq\lambda'_j\}.}
$$

Solution

Past exam of the mathematics course of the University of Cambridge / 2021 / iii / Paper 160 / 3 / a / i / Solution

{c}
{wiki=Hook_length_formula#Young_diagrams}

The hook $H_{i,j}(\lambda)$ consists of $(i,j)$, the cells to its right in row $i$, and the cells below it in column $j$. Its hook length is
$$
h_{i,j}(\lambda)=\lambda_i-j+\lambda'_j-i+1.
$$

= Young-diagram hook
{c}
{synonym}


Codex @codex  0

 Incoming links: Hook of a Young diagram