Melzer's identities revisited
classification
🧮 math.QA
hep-thmath.CO
keywords
identitiesmelzerpathpolynomialboson-fermioncasecharacterscombinatorial
read the original abstract
We further develop the finite length path generating transforms introduced previously, and use them to obtain constant sign polynomial expressions that reduce, in the limit of infinite path lengths, to parafermion and ABF Virasoro characters. This provides us, in the ABF case, with combinatorial proofs of Melzer's boson-fermion polynomial identities.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.