Jehanne Dousse
Published 2017-02-23Version 1
Alladi and Gordon introduced the method of weighted words in 1993 to prove a refinement and generalisation of Schur's partition identity. Together with Andrews, they later used it to refine Capparelli's and G\"ollnitz' identities too. In this paper, we present a new variant of this method, which can be used to study more complicated partition identities, and apply it to prove refinements and generalisations of three partition identities. The first one, Siladi\'c's theorem (2002), comes from vertex operator algebras. The second one, a conjectural identity of Primc (1999), comes from crystal base theory. The last one is a very general identity about coloured overpartitions which generalises and unifies several generalisations of Schur's theorem due to Alladi-Gordon, Andrews, Corteel-Lovejoy, Lovejoy and the author.
Comments: 10 pages. Accepted in the proceedings of FPSAC 2017. The detailed proofs can be found in arXiv:1602.05472, arXiv:1606.09623 and arXiv:1612.05423
On a Rogers-Ramanujan type identity from crystal base theory
Siladić's theorem: weighted words, refinement and companion
Design-theoretic analogies between codes, lattices, and vertex operator algebras
![QR code for arXiv:1702.07177 [math.CO]](http://oss.arxitics.com/images/favicon.svg)