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

TL;DR

This paper characterizes minimal partitions with fixed s-core and t-core, identifying the smallest n for non-empty sets, and establishes bijections with (0,1)-matrices, also analyzing conjugate and self-conjugate cases.

Contribution

It determines the minimal n for non-empty partitions with given s- and t-cores and links these partitions to (0,1)-matrices, also analyzing conjugation properties.

Findings

Identified the smallest n for non-empty partition sets with given cores.

Established a bijection between minimal partitions and (0,1)-matrices.

Characterized when these sets contain conjugate or self-conjugate partitions.

Abstract

Suppose $s$ and $t$ are coprime positive integers, and let $\sigma$ be an $s$-core partition and $\tau$ a $t$-core partition. In this paper we consider the set $\mathcal P_{\sigma,\tau}(n)$ of partitions of $n$ with $s$-core $\sigma$ and $t$-core $\tau$. We find the smallest $n$ for which this set is non-empty, and show that for this value of $n$ the partitions in $\mathcal P_{\sigma,\tau}(n)$ (which we call $(\sigma,\tau)$-minimal partitions) are in bijection with a certain class of $(0,1)$-matrices with $s$ rows and $t$ columns. We then use these results in considering conjugate partitions: we determine exactly when the set $\mathcal P_{\sigma,\tau}(n)$ consists of a conjugate pair of partitions, and when $\mathcal P_{\sigma,\tau}(n)$ contains a unique self-conjugate partition.