Related papers: Partition identities associated to Rogers-Ramanuja…
A bijection is presented between (1): partitions with conditions $f_j+f_{j+1}\leq k-1$ and $ f_1\leq i-1$, where $f_j$ is the frequency of the part $j$ in the partition, and (2): sets of $k-1$ ordered partitions $(n^{(1)}, n^{(2)}, ...,…
The product sides of the Rogers--Ramanujan identities and alike often appear to be "transparently modular" (functions). The old work by Rogers (1894) and recent work by Rosengren make use (somewhat implicitly) of this fact for proving the…
Recently, Andrews and EI Bachraoui discovered several companions for some famous $q$-series formulas, and derived some new identities involving partitions and overpartitions with distinct parts. In this paper, we shall refine their results…
Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.
A new sums-of-tails identity involving two parameters $b$ and $d$ is obtained and is used to derive more results of similar type. One of Ramanujan's sums-of-tails identities from the Lost Notebook is shown to be a special case of our…
This paper will primarily present a method of proving generating function identities for partitions from linked partition ideals. The method we introduce is built on a conjecture by George Andrews and that those generating functions satisfy…
A special case of an elegant result due to Anderson proves that the number of $(s,s+1)$-core partitions is finite and is given by the Catalan number $C_s$. Amdeberhan recently conjectured that the number of $(s,s+1)$-core partitions into…
We obtain a finite form of Jacobi's identity and present a combinatorial proof based on the structure of synchronized partitions.
Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…
An identity by Ramanujan related to the multisection of Bernoulli numbers is revisited. Two alternative approaches are proposed, both relying on the multisection technique. A geometric approach reveals the role played by the symmetries of…
Motivated by Alladi's recent multi-dimensional generalization of Sylvester's classical identity, we provide a simple combinatorial proof of an overpartition analogue, which contains extra parameters tracking the numbers of overlined parts…
Euler's partition identity states that the number of partitions of $n$ into odd parts is equal to the number of partitions of $n$ into distinct parts. Strikingly, Straub proved in 2016 that this identity also holds when counting partitions…
In a recent paper, Andrews and Merca investigated the number of even parts in all partitions of $n$ into distinct parts, which arise naturally from the Euler-Glaisher bijective proof. They obtained new combinatorial interpretations for this…
Euler's classical identity states that the number of partitions of an integer into odd parts and distinct parts are equinumerous. Franklin gave a generalization by considering partitions with exactly $j$ different multiples of $r$, for a…
For any non-negative integer $n$ and non-zero integer $r$, let $p_r(n)$ denote Ramanujan's general partition function. By employing $q$-identities, we prove some new Ramanujan-type congruences modulo 5 for $p_r(n)$ for $r=-(5\lambda+1),…
We present two general finite extensions for each of the two Rogers-Ramanujan identities. Of these one can be derived directly from Watson's transformation formula by specialization or through Bailey's method, the second similar formula can…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
Let ${{B}_{3}}(n)$ denote the number of partition triples of $n$ where each partition is 3-core. With the help of generating function manipulations, we find several infinite families of arithmetic identities and congruences for…
Andrews, Lewis and Lovejoy introduced the partition function PD(n) as the number of partitions of $n$ with designated summands, where we assume that among parts with equal size, exactly one is designated. They proved that PD(3n+2) is…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…