Ferrers diagram
= Ferrers diagram
{c}
A <Ferrers diagram> of an <integer partition> $\lambda$ is a left-aligned array of dots with $\lambda_i$ dots in row $i$, using the longest row at the top here. Replacing each dot by a square cell gives a <Young diagram>. Reading the column lengths gives the <conjugate partition>.<Enumerative Combinatorics, Volume 1 (second-edition draft) by Richard Stanley>[section 1.7, Ferrers and Young diagrams]{ref}