Ferrars diagram | Ferrers graph | graphical representation | Young diagram

A Ferrers diagram represents partitions as patterns of dots, with the nth row having the same number of dots as the nth term in the partition. The spelling "Ferrars" is sometimes also used, and the diagram is sometimes called a graphical representation or Ferrers graph. A Ferrers diagram of the partition n = a + b + ... + c, for a list a, b, ..., c of k positive integers with a>=b>=...>=c is therefore the arrangement of n dots or square boxes in k rows, such that the dots or boxes are left-justified, the first row is of length a, the second row is of length b, and so on, with the kth row of length c. The above diagram corresponds to one of the possible partitions of 100.

conjugate partition | Durfee square | self-conjugate partition | staircase walk