self-conjugate partitions with restrictions

303 Views Asked by At

Is there a generating function for the number of symmetric Ferrers diagrams contained in a square ? I think we need to sum up the number self-conjugate partitions of n starting from $n=1$ to $n=k^2$ with highest part $k$ but I am wondering if there is a direct formula for this. Thanks

1

There are 1 best solutions below

0
On

If you mark the sides of the square according to where the diagram jumps, both sides will be marked the same, and can be marked however we please, which means these partitions are in bijection with the possible sets of marks, which is $2^k$ where $k$ is the side length.