pith. sign in

arxiv: 0805.2461 · v1 · submitted 2008-05-16 · 🧮 math.NT · math.CO

Hook lengths and 3-cores

classification 🧮 math.NT math.CO
keywords hooklengthspartitionsa000731a033687formulatermsauthor
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.