Abstract

In this paper, we give the generalization of MacMahon's type combinatorial identities. A generalized $q$-series is interpreted as the generating function of two different combinatorial objects, viz., restricted $n$-color partitions and weighted lattice paths which give entirely new Rogers–Ramanujan–MacMahon type combinatorial identities. This result yields an infinite class of 2-way combinatorial identities which further extends the work of Agarwal and Goyal. We also discuss the bijective proof of the main result. Forbye, eight particular cases are also discussed which give a combinatorial interpretation of eight entirely new Rogers–Ramanujan type identities.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call