DOIAbstract
AbstractWe establish generalizations of certain partition theorems originating with modular equations and give bijective proofs for them. As a special case, we give a bijective proof of the Farkas and Kra partition theorem modulo 7
AbstractWe establish generalizations of certain partition theorems originating with modular equations and give bijective proofs for them. As a special case, we give a bijective proof of the Farkas and Kra partition theorem modulo 7
The partition theoretic Rogers–Ramanujan identities assert that for a = 0, 1 and any n, the number o...
In our previous paper (J. Comb. Theory Ser. A 120(1):28–38, 2013), we determined a unified combinato...
In our previous paper (J. Comb. Theory Ser. A 120(1):28–38, 2013), we determined a unified combinato...
We provide a general and unified combinatorial framework for a number of colored partition identitie...
We provide a general and unified combinatorial framework for a number of colored partition identitie...
We provide a general and unified combinatorial framework for a number of colored partition identitie...
AbstractWe provide a general and unified combinatorial framework for a number of colored partition i...
We prove generalizations of some partition theorems of Farkas and Kra. (c) 2004 Elsevier Inc. All ri...
Abstract. We present an extensive survey of bijective proofs of classical partitions identities. Whi...
AbstractA bijective proof of a general partition theorem is given which has as direct corollaries ma...
This dissertation involves two topics. The first is on the theory of partitions, which is discussed ...
AbstractThe purpose of this paper is to present new proofs of modular identities (1.1) and (1.2). Th...
AbstractThe purpose of this paper is to present new proofs of modular identities (1.1) and (1.2). Th...
AbstractWe show that certain modular equations and theta function identities of Ramanujan imply eleg...
AbstractOn page 189 in his lost notebook, Ramanujan recorded five assertions about partitions. Two a...
The partition theoretic Rogers–Ramanujan identities assert that for a = 0, 1 and any n, the number o...
In our previous paper (J. Comb. Theory Ser. A 120(1):28–38, 2013), we determined a unified combinato...
In our previous paper (J. Comb. Theory Ser. A 120(1):28–38, 2013), we determined a unified combinato...
We provide a general and unified combinatorial framework for a number of colored partition identitie...
We provide a general and unified combinatorial framework for a number of colored partition identitie...
We provide a general and unified combinatorial framework for a number of colored partition identitie...
AbstractWe provide a general and unified combinatorial framework for a number of colored partition i...
We prove generalizations of some partition theorems of Farkas and Kra. (c) 2004 Elsevier Inc. All ri...
Abstract. We present an extensive survey of bijective proofs of classical partitions identities. Whi...
AbstractA bijective proof of a general partition theorem is given which has as direct corollaries ma...
This dissertation involves two topics. The first is on the theory of partitions, which is discussed ...
AbstractThe purpose of this paper is to present new proofs of modular identities (1.1) and (1.2). Th...
AbstractThe purpose of this paper is to present new proofs of modular identities (1.1) and (1.2). Th...
AbstractWe show that certain modular equations and theta function identities of Ramanujan imply eleg...
AbstractOn page 189 in his lost notebook, Ramanujan recorded five assertions about partitions. Two a...
The partition theoretic Rogers–Ramanujan identities assert that for a = 0, 1 and any n, the number o...
In our previous paper (J. Comb. Theory Ser. A 120(1):28–38, 2013), we determined a unified combinato...
In our previous paper (J. Comb. Theory Ser. A 120(1):28–38, 2013), we determined a unified combinato...
Add to ORKG