Partitions and Ferrers Diagrams
We’ve discussed partitions before, but they’re about to become very significant. Let be a sequence of positive integers with . We write
If we say is a partition of , and we write . A partition, then, is a way of breaking a positive integer into a bunch of smaller positive integers, and sorting them in (the unique) decreasing order.
We visualize partitions with Ferrers diagrams. The best way to explain this is with an example: if , the Ferrers diagram of is
The diagram consists of left-justified rows, one for each part in the partition , and arranged from top to bottom in decreasing order. We can also draw the Ferrers diagram as boxes
The dangling vertical lines aren’t supposed to be there, but I’m having a hell of a time getting WordPress’ processor to recognize an \hfill command so I can place \vline elements at the edges of columns. This should work but.. well, see for yourself:
So, if anyone knows how to make this look like the above diagram, but without the dangling vertical lines, I’d appreciate the help.
Anyway, in both of those ugly, ugly Ferrers diagrams, the is placed in the position; we see this by counting down two boxes and across three boxes. We will have plenty of call to identify which positions in a Ferrers diagram are which in the future.