Related papers: Self-conjugate $t$-core partitions and application…

Let $pod_2(n)$ denote the number of $2$-regular partitions of $n$ with distinct odd parts (even parts are unrestricted). In this article, we obtain congruences for $pod_2(n)$ mod $2$ and mod $8$ using some generating function manipulations…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called \emph{partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

In 1997, Bousquet-Melou and Eriksson initiated the study of lecture hall partitions, a fascinating family of partitions that yield a finite version of Euler's celebrated odd/distinct partition theorem. In subsequent work on s-lecture hall…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…

Recent work of Garvan, Sellers, Smoot, and others has made connections between infinite families of congruences for various partition functions. Here, we apply this approach to families of congruences for PED and POD partitions and find…

The study of core partitions has been very active in recent years, with the study of $(s,t)$-cores - partitions which are both $s$- and $t$-cores - playing a prominent role. A conjecture of Armstrong, proved recently by Johnson, says that…

Tverberg's theorem bounds the number of points $\mathbb{R}^d$ needed for the existence of a partition into $r$ parts whose convex hulls intersect. If the points are colored with $N$ colors, we seek partitions where each part has at most one…

The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…

It is well-known that Catalan numbers $C_n = \frac{1}{n+1} \binom{2n}{n}$ count the number of dominant regions in the Shi arrangement of type $A$, and that they also count partitions which are both $n$-cores as well as $(n+1)$-cores. These…

Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…

We exhibit, for any positive integer parameter $s$, an involution on the set of integer partitions of $n$. These involutions show the joint symmetry of the distributions of the following two statistics. The first counts the number of parts…

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…

A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.

Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This implies the first non-trivial lower bound for the number of…

Hirschhorn and Sellers studied arithmetic properties of the number of partitions with odd parts distinct. In another direction, Hammond and Lewis investigated arithmetic properties of the number of bipartitions. In this paper, we consider…

In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…

In a recent work, Nadji and Ahmia introduced the $t$-Schur overpartitions as an overpartition analogue for $t$-Schur partitions, which generalizes the classical Schur's partitions into parts congruent to $1$ or $5$ modulo $6$. We continue…

For the past several years, numerous authors have studied POD and PED partitions from a variety of perspectives. These are integer partitions wherein the odd parts must be distinct (in the case of POD partitions) or the even parts must be…