A Chinese Remainder Theorem for Partitions

TL;DR

This paper establishes a quasipolynomial formula for counting certain partitions with fixed core properties, revealing a Chinese Remainder Theorem-like structure in partition enumeration.

Contribution

It introduces a novel quasipolynomial characterization of the number of partitions with specified core partitions, extending classical combinatorial results.

Findings

N_{\sigma, au}(k) is a quasipolynomial for large k

The period of the quasipolynomial is the least common multiple of s and t

The degree of the quasipolynomial is (1/d)(s-d)(t-d)

Abstract

Let $s,t$ be natural numbers, and fix an $s$-core partition $\sigma$ and a $t$-core partition $\tau$. Put $d=\gcd(s,t)$ and $m= lcm(s,t)$, and write $N_{\sigma, \tau}(k)$ for the number of $m$-core partitions of length no greater than $k$ whose $s$-core is $\sigma$ and $t$-core is $\tau$. We prove that for $k$ large, $N_{\sigma, \tau}(k)$ is a quasipolynomial of period $m$ and degree $\frac{1}{d}(s-d)(t-d)$.