# A Chinese Remainder Theorem for Partitions

@inproceedings{Seethalakshmi2021ACR, title={A Chinese Remainder Theorem for Partitions}, author={K. A. Seethalakshmi and Steven Spallone}, year={2021} }

Let s, t be natural numbers, and fix an s-core partition σ and a t-core partition τ . Put d = gcd(s, t) and m = lcm(s, t), and write Nσ,τ (k) for the number of m-core partitions of length no greater than k whose s-core is σ and t-core is τ . We prove that for k large, Nσ,τ (k) is a quasipolynomial of period m and degree 1 d (s− d)(t− d).

## References

SHOWING 1-10 OF 14 REFERENCES

### Counting partitions on the abacus

- Mathematics
- 2006

Abstract
In 2003, Maróti showed that one could use the machinery of ℓ-cores and ℓ-quotients of partitions to establish lower bounds for p(n), the number of partitions of n. In this paper we explore…

### A generating function for all semi-magic squares and the volume of the Birkhoff polytope

- Mathematics
- 2009

We present a multivariate generating function for all n×n nonnegative integral matrices with all row and column sums equal to a positive integer t, the so called semi-magic squares. As a consequence…

### The Representation Theory of the Symmetric Group

- Mathematics
- 2009

1. Symmetric groups and their young subgroups 2. Ordinary irreducible representations and characters of symmetric and alternating groups 3. Ordinary irreducible matrix representations of symmetric…

### Theory of linear and integer programming

- MathematicsWiley-Interscience series in discrete mathematics and optimization
- 1999

Introduction and Preliminaries. Problems, Algorithms, and Complexity. LINEAR ALGEBRA. Linear Algebra and Complexity. LATTICES AND LINEAR DIOPHANTINE EQUATIONS. Theory of Lattices and Linear…