A Chinese Remainder Theorem for Partitions
Combinatorics
2022-02-01 v2
Abstract
Let be natural numbers, and fix an -core partition and a -core partition . Put and , and write for the number of -core partitions of length no greater than whose -core is and -core is . We prove that for large, is a quasipolynomial of period and degree .
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