Minimal partitions with a given $s$-core and $t$-core
Combinatorics
2021-12-09 v2
Abstract
Suppose and are coprime positive integers, and let be an -core partition and a -core partition. In this paper we consider the set of partitions of with -core and -core . We find the smallest for which this set is non-empty, and show that for this value of the partitions in (which we call -minimal partitions) are in bijection with a certain class of -matrices with rows and columns. We then use these results in considering conjugate partitions: we determine exactly when the set consists of a conjugate pair of partitions, and when contains a unique self-conjugate partition.
Keywords
Cite
@article{arxiv.2011.08643,
title = {Minimal partitions with a given $s$-core and $t$-core},
author = {Matthew Fayers},
journal= {arXiv preprint arXiv:2011.08643},
year = {2021}
}