Hook lengths and 3-cores

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
7 pages

Citation

Consulte el texto completo en el siguiente enlace:

Collections