Hook lengths and 3-cores

Details Hook lengths and 3-cores Hook lengths and 3-cores

2008-05-16

arxiv.org/abs/0805.2461v1

Mathematics

Number Theory

7 pages

Scientific paper

Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he conjectured that $A000731(n)=0$ if and only if $A033687(n)=0$. The numbers $A000731(n)$ are given in terms of hook lengths of partitions, while $A033687(n)$ equals the number of 3-core partitions of $n$. Here we prove this conjecture.

Affiliated with

Also associated with

No associations

Rating

Hook lengths and 3-cores does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hook lengths and 3-cores, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hook lengths and 3-cores will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-272469