Related papers: Beck-type identities: new combinatorial proofs and…

We provide a refined combinatorial identity for the set of partitions of $\{1,\dots, n\}$, which plays an important role in investigating several limit theorems related to finite free convolutions. Firstly, we present the finite free…

Berkovich-Uncu have recently proved a companion of the well-known Capparelli's identities as well as refinements of Savage-Sills' new little G\"ollnitz identities. Noticing the connection between their results and Boulet's earlier…

We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…

In a recent article on overpartitions, Merca considered the auxiliary function $a(n)$ which counts the number of partitions of $n$ where odd parts are repeated at most twice (and there are no restrictions on the even parts). In the course…

We present a new identity involving compositions (i.e. ordered partitions of natural numbers). The Formula has its origin in complex dynamical systems and appears when counting, in the polynomial family $\{f_c:z \mapsto z^d + c \}$,…

Tverberg's theorem states that any set of $t(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Moreover, generic collections of fewer points cannot be so…

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

We propose and prove a new polynomial identity that implies Schur's partition theorem. We give combinatorial interpretations of some of our expressions in the spirit of Kur\c{s}ung\"oz. We also present some related polynomial and $q$-series…

The study of flattened partitions is an active area of current research. In this paper, our study unexpectedly leads us to the OEIS numbers A124324. We provide a new combinatorial interpretation of these numbers. A combinatorial bijection…

It is proved that the number of partitions of n with odd mex and k parts that aren't ones equals the number of partitions of n with nonnegative crank and k parts that aren't ones..

For a positive integer $n$, let $B_{\ell_1,\dots,\ell_r}(n)$ denote the number of $(\ell_1,\ell_2,\cdots,\ell_r)$-regular multipartitions of $n$. If $\ell_1=\ell_2=\cdots=\ell_r=\ell$, then we denote $B_{\ell_1,\dots,\ell_r}(n)$ as…

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…

The Ward numbers $W(n,k)$ combinatorially enumerate set partitions with block sizes $\geq 2$ and phylogenetic trees (total partition trees). We prove that $W(n,k)$ also counts \emph{increasing Schr\"oder trees} by verifying they satisfy…

The BG-rank BG($\pi$) of an integer partition $\pi$ is defined as $$\text{BG}(\pi) := i-j$$ where $i$ is the number of odd-indexed odd parts and $j$ is the number of even-indexed odd parts of $\pi$. In a recent work, Fu and Tang ask for a…

Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge…

We investigate the number $N_{d,r}(s)$ of $(s, s+r)$-core integer partitions with $d$-distinct parts. Our first main result is a proof of a recurrence relation conjectured by Sahin in 2018. We also derive generating functions, asymptotics,…

Partition theory abounds with bijections between different types of partitions. One of the most famous partition bijections maps each self-conjugate partition of a positive integer $n$ to a partition of $n$ into distinct odd parts, and vice…

A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…

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…

The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of…