A combinatorial proof and refinement of a partition identity of Siladić

preprint2013arXivOpen access

Abstract

In this paper we give a combinatorial proof and refinement of a Rogers-Ramanujan type partition identity of Siladić arising from the study of Lie algebras. Our proof uses generating functions and qq-difference equations.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.