## 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.

Hello,

Thank you very much for your posts on representations.

I would suggest something like this for the Ferrers’ diagrams, hoping that the multicolumn command is recognized !

Comment by FelixCQ | December 9, 2010 |

Thanks, Felix, I’ll examine that one more closely.

Comment by John Armstrong | December 9, 2010 |

[...] a partition of , we define a Young tableau of shape to be an array of numbers. We start with the Ferrers diagram of the partition , and we replace the dots with the numbers to in any order. Clearly, there are [...]

Pingback by Young Tableaux « The Unapologetic Mathematician | December 9, 2010 |

Hello John,

Firstly I just wanted to say thank you for this blog- I’ve just started a PhD in representation theory and this has been an invaluable resource and good way to idle away some hours usefully!

As for drawing young tableux, try the youngtab package (just google it- should be the first to come up). I used it in a dissertation and was very easy to use with good results.

Thanks again!

Comment by Andrew Poulton | December 13, 2010 |

Glad you find it useful, Andrew. Unfortunately, WordPress doesn’t let me use packages here, so I’m stuck with base . So it goes.

Comment by John Armstrong | December 13, 2010 |

[...] let . This is a pretty trivial “partition”, consisting of one piece of length . The Ferrers diagram of looks [...]

Pingback by Permutation Representations from Partitions « The Unapologetic Mathematician | December 14, 2010 |

[...] can interpret this by looking at their Ferrers diagrams. First look at the first rows of the diagrams. Are there more dots in the diagram for than in that [...]

Pingback by The Dominance Order on Partitions « The Unapologetic Mathematician | December 17, 2010 |

[...] “composition” is sort of like a partition, except the parts are allowed to come in any specified order. That is, a composition of is an [...]

Pingback by Compositions « The Unapologetic Mathematician | January 6, 2011 |

[...] for row tabloids. Of course, in doing so we have to alter our definition of the dominance order on Ferrers diagrams to take columns into account instead of [...]

Pingback by The Column Dominance Order « The Unapologetic Mathematician | January 20, 2011 |

[...] to take note of it the idea of an “inner corner” and an “outer corner” of a Ferrers diagram, and thus of a [...]

Pingback by Inner and Outer Corners « The Unapologetic Mathematician | January 26, 2011 |