On the Enumeration of $(s,s+1,s+2)$-Core Partitions
Combinatorics
2014-07-10 v2 Number Theory
Abstract
Anderson established a connection between core partitions and order ideals of certain posets by mapping a partition to its -set. In this paper, we give a characterization of the poset whose order ideals correspond to -core partitions. Using this characterization, we obtain the number of -core partitions, the maximum size and the average size of an -core partition, confirming three conjectures posed by Amdeberhan.
Keywords
Cite
@article{arxiv.1406.2583,
title = {On the Enumeration of $(s,s+1,s+2)$-Core Partitions},
author = {Jane Y. X. Yang and Michael X. X. Zhong and Robin D. P. Zhou},
journal= {arXiv preprint arXiv:1406.2583},
year = {2014}
}
Comments
20 pages