Hook lengths and 3-cores

From MaRDI portal
Publication:659624

DOI10.1007/S00026-011-0096-3zbMATH Open1233.05030arXiv0805.2461OpenAlexW1984182452MaRDI QIDQ659624FDOQ659624


Authors: Guo-Niu Han, Ken Ono Edit this on Wikidata


Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0805.2461




Recommendations




Cites Work


Cited In (18)





This page was built for publication: Hook lengths and 3-cores

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659624)