相关论文: The $A_2$ Rogers-Ramanujan identities revisited

In this paper, we establish a connection between Rogers-Ramanujan-Gordon type overpartitions to lattice paths with four kinds of unitary steps. By establishing the bijective relationship between overpartitions and lattice paths, we…

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…

Around about 1917, Issai Schur rediscovered the Rogers-Ramanujan identities, and proved a system of polynomial identities that imply them. Schur wrote that Georg Frobenius (his former advisor) had shown him a simple, direct proof of these…

George Andrews recently proved a new identity between the cardinalities of the set of Semi-Fibonacci partitions and the set of partitions into powers of two with all parts appearing an odd number of times. This paper extends the identity to…

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, 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…

Alladi and Gordon introduced the method of weighted words in 1993 to prove a refinement and generalisation of Schur's partition identity. Together with Andrews, they later used it to refine Capparelli's and G\"ollnitz' identities too. In…

Ramanujan recorded five interesting q-series identities in a section that is not as systematically arranged as the other chapters of his second notebook. These five identities do not seem to have acquired enough attention. Recently, Dixit…

Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…

Recently, George Andrews has given a Glaisher style proof of a finite version of Euler's partition identity. We generalise this result by giving a finite version of Glaisher's partition identity. Both the generating function and bijective…

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…

In 1967, Andrews found a combinatorial generalization of the G\"ollnitz-Gordon theorem, which can be called the Andrews-G\"ollnitz-Gordon theorem. In 1980, Bressoud derived a multisum Rogers-Ramanujan-type identity, which can be considered…

In this paper, we use the particle motion bijection introduced by Warnaar and developed by the two authors, Jouhet and Konan, to study q-series and partition identities of the Andrews--Gordon type with parity restrictions. These…

Recently, Andrews proved two conjectures on a partition statistic introduced by Beck. Very recently, Chern established some results on weighted rank and crank moments and proved many Andrews-Beck type congruences. Motivated by Andrews and…

We find two involutions on partitions that lead to partition identities for Ramanujan's third order mock theta functions $\phi(-q)$ and $\psi(-q)$. We also give an involution for Fine's partition identity on the mock theta function f(q).…

We provide new proofs to five of Ramanujan's intriguing identities on false theta functions without using the Rogers-Fine identity and Bailey transforms.

We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, all of them rather involved or else relying on sophisticated number theoretical…

We present a new partition identity and give a combinatorial proof of our result. This generalizes a result of Andrew's in which he considers the generation function for partitions with respect to size, number of odd parts, and number of…

We present a generalization, which we call (k,m)-rank, of Dyson's notion of rank to integer partitions with k successive Durfee rectangles and give two combinatorial symmetries associated with this new definition. We prove these symmetries…

We revisit the solvable lattice models described by Andrews Baxter and Forrester and their generalizations. The expressions for the local state probabilities were shown to be related to characters of the minimal models. We recompute these…