1
$\begingroup$

How many pairs (λ,μ) of partitions of integers are there such that λ⊢n,and the Young diagram of μ is obtained from the Young diagram of λ by adding a single square?

  • 0
    What is the symbol between $\lambda$ and $n$? I'm not familiar with it.2011-05-14
  • 0
    So $\lambda$ partitions $n$, and $\mu$ would partition $(n+1)$ s.t. the Young Tableau of $\mu$ is the Young Tableau of $\lambda$ with an extra square?2011-05-14
  • 0
    Essentially you would have to find all the integer partitions of $n$ and sum up (# of unique integers in the partition) + 1 [since you can legally add a square to the end of the Tableau]. I'm sorry for writing this out little by little, just trying to get a hold of the question in my head.2011-05-14
  • 0
    Nicolas: you're on the right track.2011-05-14

1 Answers 1