English

A Chinese Remainder Theorem for Partitions

Combinatorics 2022-02-01 v2

Abstract

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

Keywords

Cite

@article{arxiv.2105.07611,
  title  = {A Chinese Remainder Theorem for Partitions},
  author = {K. Seethalakshmi and Steven Spallone},
  journal= {arXiv preprint arXiv:2105.07611},
  year   = {2022}
}

Comments

31 pages, 3 figures

R2 v1 2026-06-24T02:09:57.375Z