I've come to ask a question about the hook-length formula for the number of stadard Young tableaux given a Ferrer's diagram . But first I feel like I owe it to the interested outsider to provide some background:
The beginnings of why most people would care about my eventual question lies in the depths of representation theory of finite groups (rep theory). Roughly the goal of rep theory is to study homomorphisms of the form where is some finite group and is the general linear group over some complex vector space called the representation for (one can study representations on vector spaces over fields other than , but things get much messier--especially in characteristic ).One of the most easily understood reason why anyone would want to study representation theory is that it often enables one to give slicker proofs of some theorems in group theory--often the alternative pure group theoretic proof being much, much more difficult. The classical example if this being Burnside's Theorem
One discovers that (like most math subjects) the study of all representations is redundant--one can study more fundamental building blocks to get the idea about everything (like studying simple groups instead of general groups). In representation theory these building blocks take the form of irreducible representations which are homomorphisms such that the only subspaces of which are invariant under for every is and . More fundamental though than the irreps themselves are the equivalence classes of irreps where an equivalence relation is defined on the set of all representations of (known as ) by declaring that and are equivalent if there exists an isomorphism such that for every . There are some fascinating theorems about these equivalence classes. To name some it's true that the number of equivalence classes of irreps of is the number of conjugacy classes of , if denotes the set of all these equivalence classes and for each denotes the common dimension for each of the representation spaces for each then , the number of equivalence classes in with is equal to (where is the abelinization of defined to be ), , etc.
Of course one of the most interesting groups to study is the symmetric group and the awesome fact is that there is a beautiful interplay between combinatorics and the study of the representation theory of . To understand this one needs to understand what a Ferrer's diagram is. Namely, a Ferrer's diagram is a collection of left-justified boxes arranged in rows such that (going top to bottom) each row has no less boxes than the one succeeding it. For example:
(sorry for the gray background--it was taken from my blog). We normally denote Ferrer's diagrams with symbol like and if the diagram as boxes we're apt to call it a -frame. From a Ferrer's diagram we can define a Young tableaux to be a -frame with the boxes bijectively filled in with the numbers . So, for example
Much more important for our purposes though are standard Young tableaux which are Young Tableaux in such a way that the columns and rows are increasing as one travels down and to the right respectively. So while the above Young tableaux is not standard the following one is
An interesting question then is that given a -frame how many standard Young tableaux are there whose underlying Ferrer's diagram is ? We denote the number of these by .
So, what does this have to do with representation theory? Well, it turns out that if tex denotes the set of all -frames that there exists a bijection (recalling that is the equivalence classes of irreps of ) and moreover that the correspondence is such that if is the irrep associated to then and since these dimensions are important to us (as the previous list of facts seems to suggest) this is great!....assuming that there is an easy way to calculate . Fortunately there is-- a very easy method! To describe this formula (yes it is a formula) one needs to define the hook-length of a -frame. Namely, given a -frame and some (where denotes the block at the position--using the usual matrix notation) we define the hook length of denoted to be the number of blocks to the right of plus the number of blocks below plus one. In practice this counts the the 'hook' formed by picking a position and coloring all the blocks in that position's row to the right and the position itself and coloring the boxes below the position and counting the colored block. For example, the hook at position in the following Ferrer's diagram is marked
It turns out then that for a given -frame one has that
Why is this true? I can prove it using an admittedly ineqloquent method, but I have zero intuition about it. Does anyone know a logical explanation of why this makes sense?