English

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 (a,b)(a, b)-core partition, for any relatively prime positive integers aa and bb, and asked whether there exists an (a,b)(a, b)-core that contains all other (a,b)(a, b)-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 (a,b,c)(a, b, c) does there exist an (a,b,c)(a, b, c)-core that contains all other (a,b,c)(a, b, c)-cores as subpartitions? We completely answer this question when aa, bb, and cc 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

R2 v1 2026-06-22T05:19:30.380Z