When Does the Set of $(a, b, c)$-Core Partitions Have a Unique Maximal Element?
Combinatorics
2014-11-27 v2
Abstract
In 2007, Olsson and Stanton gave an explicit form for the largest -core partition, for any relatively prime positive integers and , and asked whether there exists an -core that contains all other -cores as subpartitions; this question was answered in the affirmative first by Vandehey and later by Fayers independently. In this paper we investigate a generalization of this question, which was originally posed by Fayers: for what triples of positive integers does there exist an -core that contains all other -cores as subpartitions? We completely answer this question when , , and are pairwise relatively prime; we then use this to generalize the result of Olsson and Stanton.
Cite
@article{arxiv.1408.0550,
title = {When Does the Set of $(a, b, c)$-Core Partitions Have a Unique Maximal Element?},
author = {Amol Aggarwal},
journal= {arXiv preprint arXiv:1408.0550},
year = {2014}
}
Comments
8 pages, 2 figures