Hook lengths and 3-cores
Number Theory
2008-05-19 v1 Combinatorics
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 if and only if . The numbers are given in terms of hook lengths of partitions, while equals the number of 3-core partitions of . Here we prove this conjecture.
Cite
@article{arxiv.0805.2461,
title = {Hook lengths and 3-cores},
author = {Guo-Niu Han and Ken Ono},
journal= {arXiv preprint arXiv:0805.2461},
year = {2008}
}
Comments
7 pages