Related papers: Andrews Style Partition Identities
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…
Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…
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.
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…
Recently, Andrews, Hirschhorn and Sellers have proven congruences modulo 3 for four types of partitions using elementary series manipulations. In this paper, we generalize their congruences using arithmetic properties of certain quadratic…
Based on a bijection due to Fu and Tang, we provide combinatorial proofs of several partition identities of Andrews and Merca. We also introduce two weights for partitions to extend one of these identities.
We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews…
A generalization of a beautiful $q$-series identity found in the unorganized portion of Ramanujan's second and third notebooks is obtained. As a consequence, we derive a new three-parameter identity which is a rich source of…
In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…
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…
We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…
Folsom, Kent, and Ono used the theory of modular forms modulo $\ell$ to establish remarkable ``self-similarity'' properties of the partition function and give an overarching explanation of many partition congruences. We generalize their…
Since their introduction by Andrews, generalized Frobenius partitions have interested a number of authors, many of whom have worked out explicit formulas for their generating functions in specific cases. This has uncovered interesting…
We study the Andrews-Schilling-Warnaar sum-sides for the principal characters of standard (i.e., integrable, highest weight) modules of $\mathrm{A}_2^{(1)}$. These characters have been studied recently by various subsets of Corteel, Dousse,…
We give a commutative algebra viewpoint on Andrews recursive formula for the partitions appearing in "Gordon's identities", which are a generalization of Rogers-Ramanujan identities. Using this approach and differential ideals we conjecture…
In a series of papers, George Andrews and various coauthors successfully revitalized seemingly forgotten, powerful machinery based on MacMahon's $\Omega$ operator to systematically compute generating functions $\sum_{\la \in P}…
The study of partitions with parts separated by parity was initiated by Andrews in connection with Ramanujan's mock theta functions, and his variations on this theme have produced generating functions with a large variety of different…
We prove multiplicative congruences mod $2^{12}$ for George Andrews's partition function, $\overline{\mathcal{EO}}(n)$, the number of partitions of $n$ in which every even part is less than each odd part and only the largest even part…
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 prove a family of partition identities which is "dual" to the family of Andrews-Gordon's identities. These identities are inspired by a correspondence between a special type of partitions and "hypergraphs" and their proof uses…