Related papers: A Chinese Remainder Theorem for Partitions

This paper addresses the problem of finding $Q_{m,t}\left(n\right)$, the number of possible ways to partition any member $n$ of the cyclic group $\mathbb{Z}/m\mathbb{Z}$ into $t$ distinct parts. When $m$ is odd, it was previously known that…

We give a new proof of a partition theorem popularly known as Elder's theorem, but which is also credited to Stanley and Fine. We extend the theorem to the context of colored partitions (or prefabs). More specifically, we give analogous…

We improve S.-C. Chen's result on the parity of Schur's partition function. Let $A(n)$ be the number of Schur's partitions of $n$, i.e., the number of partitions of $n$ into distinct parts congruent to $1, 2 \mod{3}$. S.-C. Chen…

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

In 2016, Nath and Sellers proposed a conjecture regarding the precise largest size of ${(s,ms-1,ms+1)}$-core partitions. In this paper, we prove their conjecture. One of the key techniques in our proof is to introduce and study the…

We prove that for all natural numbers k,n,d with k <= d and every partition lambda of size kn with at most k parts there exists an irreducible GL(d, C)-representation of highest weight 2*lambda in the plethysm Sym^k(Sym^(2n) (C^d)). This…

Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

Recently, George Beck introduced two partition statistics $NT(m,j,n)$ and $M_{\omega}(m,j,n)$, which denote the total number of parts in the partition of $n$ with rank congruent to $m$ modulo $j$ and the total number of ones in the…

Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

Suppose $s$ and $t$ are coprime natural numbers. A theorem of Olsson says that the $t$-core of an $s$-core partition is again an $s$-core. We generalise this theorem, showing that the $s$-weight of the $t$-core of a partition $\lambda$ is…

A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…

For an integer $m\ge 2$, a partition $\lambda=(\lambda_1,\lambda_2,\ldots)$ is called $m$-falling, a notion introduced by Keith, if the least nonnegative residues mod $m$ of $\lambda_i$'s form a nonincreasing sequence. We extend a bijection…

Simultaneous core partitions have been widely studied in the past 20 years. In 2013, Amdeberhan gave several conjectures on the number, the average size, and the largest size of $(t,t+1)$-core partitions with distinct parts, which was…

A $(k,\ell )$ partial partition of an $n$-element set is a collection of $\ell $ pairwise disjoint $k$-element subsets. It is proved that, if $n$ is large enough, one can find $\left\lfloor {n\choose k}/{\ell}\right\rfloor$ such partial…

Amdeberhan conjectured that the number of $(t,t+1, t+2)$-core partitions is $\sum_{0\leq k\leq [\frac{t}{2}]}\frac{1}{k+1}\binom{t}{2k}\binom{2k}{k}$. In this paper, we obtain the generating function of the numbers $f_t$ of $(t, t + 1, ...,…

IMPORTANT NOTE: This paper is much rougher than I'd usually submit, and not entirely complete, though the main theorems and proofs should not be hard to follow. Given the ongoing strike at UK Universities it may be some time before I get to…

Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…

The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…