Related papers: Parity Considerations in Rogers-Ramanujan-Gordon T…
In this paper, we study restricted excludant statistics depending on its parity in partitions where parts with same parity are distinct. Using $q$-series transformations, we show that generating functions of these partition statistics are…
Ramanujan proved three famous congruences for the partition function modulo 5, 7, and 11. The first author and Boylan proved that these congruences are the only ones of this type. In 1984 Andrews introduced the $m$-colored Frobenius…
We prove polynomial boson-fermion identities for the generating function of the number of partitions of $n$ of the form $n=\sum_{j=1}^{L-1} j f_j$, with $f_1\leq i-1$, $f_{L-1} \leq i'-1$ and $f_j+f_{j+1}\leq k$. The bosonic side of the…
Recently, Andrews gave a detailed study of partitions with even parts below odd parts in which only the largest even part appears an odd number of times. In this paper, we provide a combinatorial proof of the generating function identity of…
In 2015 Cristian-Silviu Radu designed an algorithm to detect identities of a class studied by Ramanujan and Kolberg. This class includes the famous identities by Ramanujan which provide a witness to the divisibility properties of $p(5n+4),$…
In this note we conjecture Rogers-Ramanujan type colored partition identities for an array with odd number of rows w such that the first and the last row consist of even positive integers. In a strange way this is different from the…
In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…
In this note we show how to rederive the $A_2$ Rogers-Ramanujan identities proven by Andrews, Schilling and Warnaar using cylindric partitions. This paper is dedicated to George Andrews for his $80^{th}$ birthday.
We study the generating functions for cylindric partitions with profile $(c_1,c_2,c_3)$ for all $c_1,c_2,c_3$ such that $c_1+c_2+c_3=5$. This allows us to discover and prove seven new $A_2$ Rogers-Ramanujan identities modulo $8$ with…
We report on findings of a variant of ${\texttt{IdentityFinder}}$ - a Maple program that was used by two of the authors to conjecture several new identities of Rogers-Ramanujan kind. In the present search, we modify the parametrization of…
We show that, in many cases, there are infinitely many sets of partitions corresponding to a single analytical Rogers-Ramanujan type identity. This means that a single analytical Rogers-Ramanujan type identity implies the existence of…
Ramanujan's celebrated partition congruences modulo $\ell\in \{5, 7, 11\}$ assert that $$ p(\ell n+\delta_{\ell})\equiv 0\pmod{\ell}, $$ where $0<\delta_{\ell}<\ell$ satisfies $24\delta_{\ell}\equiv 1\pmod{\ell}.$ By proving Subbarao's…
The G\"ollnitz-Gordon identities were found by G\"ollnitz and Gordon independently. In 1967, Andrews obtained a combinatorial generalization of the G\"ollnitz-Gordon identities, called the Andrews-G\"ollnitz-Gordon theorem. In 1980,…
In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan's "Lost" Notebook, we obtain weighted forms of Euler's theorem on partitions with odd parts and distinct parts. This work is inspired by…
In 2019, Andrews investigated integer partitions in which all parts of a given parity are smaller than those of the opposite parity and introduced eight partition functions based on the parity of the smaller parts and parts of a given…
We find an involution as a combinatorial proof of a Ramanujan's partial theta identity. Based on this involution, we obtain a Franklin type involution for squares in the sense that the classical Franklin involution provides a combinatorial…
Recently, Amdeberhan and Merca proved some arithmetic properties of the crank parity function $C(n)$ defined as the difference between the number of partitions of $n$ with even cranks and those with odd cranks and the sequence $a(n)$ whose…
We use the celebrated circle method of Hardy and Ramanujan to develop convergent formulae for counting a restricted class of partitions that arise from the G\"ollnitz--Gordon identities.
The G\"ollnitz-Gordon-Andrews identities generalize the partition identities discovered independently by H. G\"ollnitz and B. Gordon. In this article, we present a commutative algebra proof of the G\"ollnitz-Gordon-Andrews identities. More…
We give a series of recursive identities for the number of partitions with exactly $k$ parts and with constraints on both the minimal difference among the parts and the minimal part. Using these results we demonstrate that the number of…