English

Minimal partitions with a given $s$-core and $t$-core

Combinatorics 2021-12-09 v2

Abstract

Suppose ss and tt are coprime positive integers, and let σ\sigma be an ss-core partition and τ\tau a tt-core partition. In this paper we consider the set Pσ,τ(n)\mathcal P_{\sigma,\tau}(n) of partitions of nn with ss-core σ\sigma and tt-core τ\tau. We find the smallest nn for which this set is non-empty, and show that for this value of nn the partitions in Pσ,τ(n)\mathcal P_{\sigma,\tau}(n) (which we call (σ,τ)(\sigma,\tau)-minimal partitions) are in bijection with a certain class of (0,1)(0,1)-matrices with ss rows and tt columns. We then use these results in considering conjugate partitions: we determine exactly when the set Pσ,τ(n)\mathcal P_{\sigma,\tau}(n) consists of a conjugate pair of partitions, and when Pσ,τ(n)\mathcal P_{\sigma,\tau}(n) 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}
}
R2 v1 2026-06-23T20:18:54.931Z