An iterative-bijective approach to asymmetric generalizations of Schur's theorem
Abstract
In this paper, we present a new Rogers--Ramanujan type identity for overpartitions by extending the asymmetrical version of Schur's theorem due to Lovejoy to a broader class of infinite products. More precisely, we provide a combinatorial interpretation of the following product, for any positive integer k, as a generating function for a class of overpartitions in which parts appear in 2k - 1 colors: \[ (-y1 q;q)∞ ·s (-yk q;q)∞(y1 d q;q)∞. \] Our proof is bijective and unifies two earlier approaches: Lovejoy's bijective proof of the asymmetrical Schur theorem and the iterative-bijective technique developed by Corteel and Lovejoy.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.