Hook lengths and 3-cores
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.