When Does the Set of (a, b, c)-Core Partitions Have a Unique Maximal Element?
Author(s)
Aggarwal, Amol
DownloadAggarwal-2015-When does the set.pdf (285.3Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
In 2007, Olsson and Stanton gave an explicit form for the largest (a; b)-core partition, for any relatively prime positive integers a and b, and asked whether there exists an (a; b)-core that contains all other (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) does there exist an (a; b; c)-core that contains all other (a; b; c)-cores as subpartitions? We completely answer this question when a, b, and c are pairwise relatively prime; we then use this to generalize the result of Olsson and Stanton.
Date issued
2015-05Department
Massachusetts Institute of Technology. Department of MathematicsJournal
Electronic Journal of Combinatorics
Publisher
European Mathematical Information Service (EMIS)
Citation
Aggarwal, Amol. "When Does the Set of (a, b, c)-Core Partitions Have a Unique Maximal Element?" The Electronic Journal of Combinatorics 22(2) (2015), #P2.31
Version: Final published version
ISSN
1077-8926