Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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?

share|improve this question
    
What is the symbol between $\lambda$ and $n$? I'm not familiar with it. –  Nicolas Villanueva May 14 '11 at 2:27
    
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? –  Nicolas Villanueva May 14 '11 at 2:30
    
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. –  Nicolas Villanueva May 14 '11 at 2:38
    
Nicolas: you're on the right track. –  Michael Lugo May 14 '11 at 2:42

1 Answer 1

This is A000070 in the OEIS, following the explanations given there by Jon Perry or Thomas Wieder. (Both are pretty clearly equivalent to your problem but are not stated exactly the same way.) In particular, if we call the answer to your question $f(n)$, then $f(n) = \sum_{k=1}^n p(k)$ where $p(k)$ is the number of partitions of $k$.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.