Related papers: Signed Partitions and Rogers-Ramanujan type Identi…
The Hardy-Ramanujan formula for the number of integer partitions of $n$ is one of the most popular results in partition theory. While the unabridged final formula has been celebrated as reflecting the genius of its authors, it has become…
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…
We consider signed graphs, i.e, graphs with positive or negative signs on their edges. We construct some families of bipartite signed graphs with only two distinct eigenvalues. This leads to constructing infinite families of regular…
Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…
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…
In this paper we add to the literature on the combinatorial nature of the mock theta functions, a collection of curious $q$-hypergeometric series introduced by Ramanujan in his last letter to Hardy in 1920, which we now know to be important…
Polynomial generalizations of all 130 of the identities in Slater's list of identities of the Rogers-Ramanujan type are presented. Furthermore, duality relationships among many of the identities are derived. Some of the these polynomial…
Andrews and El Bachraoui recently studied integer partitions where the smallest part is repeated a specified number of times and any other parts are distinct. Their results included two ``surprising identities'' for which they requested…
In this work, we give combinatorial proofs for generating functions of two problems, i.e., flushed partitions and concave compositions of even length. We also give combinatorial interpretation of one problem posed by Sylvester involving…
By studying non-commutative series in an infinite alphabet we introduce shift-plethystic trees and a class of integer compositions as new combinatorial models for the Rogers-Ramanujan identities. We prove that the language associated to…
In the first part of this article, we consider a Groebner basis of the differential ideal {x_1^2} with respect to "the" weighted lexicographical monomial order and show that its computation is related with an identity involving the…
In this survey article, we present an expanded version of Lucy Slater's famous list of identities of the Rogers-Ramanujan type, including identities of similar type, which were discovered after the publication of Slater's papers, and older…
A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of…
In 2015 Choi, Kim, and Lovejoy studied a weighted partition function, $A_1(m)$, which counted subpartitions with a structure related to the Rogers--Ramanujan identities. They conjectured the existence of an infinite class of congruences for…
By using the Kang-Kashiwara-Misra-Miwa-Nakashima-Nakayashiki crystal base character formula for the basic $A_2^{(1)}$-module, and the principally specialized Weyl-Kac character formula, we obtain a Rogers-Ramanujan type combinatorial…
Refinements of the classical Rogers-Ramanujan identities are given in which some parts are weighted. Combinatorial interpretations refining MacMahon's results are corollaries.
Numerical semigroups are cofinite additive submonoids of the natural numbers. In 2011, Keith and Nath illustrated an injection from numerical semigroups to integer partitions. We explore this connection between partitions and numerical…
This article is an extensive study of partitions with fixed number of odd and even-indexed odd parts. We use these partitions to generalize recent results of C. Savage and A. Sills. Moreover, we derive explicit formulas for generating…
Recently, Andrews and El Bachraoui (2024) proved three very interesting $q$-series identities, from which three simple looking identities involving certain restricted partitions into distinct even parts and $4$-regular partitions follow. In…
For positive integers $k, l \geq 2$, the set of $k$-regular partitions in which parts appear at most $l$ times has attracted a lot of interest in that a composition of Glaisher's mapping can be used to prove the associated partition…