A combinatorial proof and refinement of a partition identity of Siladi\'c
Jehanne Dousse
TL;DR
This paper provides a combinatorial proof and refinement of a Rogers-Ramanujan type partition identity related to Lie algebras, utilizing generating functions and q-difference equations.
Contribution
It offers a new combinatorial proof and refinement of Siladić's partition identity, connecting partition theory with Lie algebra studies.
Findings
New combinatorial proof of Siladić's identity
Refinement of the original partition identity
Application of generating functions and q-difference equations
Abstract
In this paper we give a combinatorial proof and refinement of a Rogers-Ramanujan type partition identity of Siladi\'c arising from the study of Lie algebras. Our proof uses generating functions and -difference equations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Advanced Mathematical Identities