English

An iterative-bijective approach to asymmetric generalizations of Schur's theorem

Combinatorics 2025-10-02 v1 Number Theory

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 kk, as a generating function for a class of overpartitions in which parts appear in 2k12^k - 1 colors: (y1q;q)(ykq;q)(y1dq;q). \frac{(-y_1 q;q)_\infty \cdots (-y_k q;q)_\infty}{(y_1 d q;q)_\infty}. 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.

Keywords

Cite

@article{arxiv.2510.00846,
  title  = {An iterative-bijective approach to asymmetric generalizations of Schur's theorem},
  author = {Laure Velenik},
  journal= {arXiv preprint arXiv:2510.00846},
  year   = {2025}
}