In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur’s celebrated partition identity (1926). Andrews’ two generalisations of Schur’s theorem went on to become two of the most influential results in the theory of partitions, finding applications in combinatorics, representation theory and quantum algebra. In this paper we generalise both of Andrews’ theorems to overpartitions. The proofs use a new technique which consists in going back and forth from $q$-difference equations on generating functions to recurrence equations on their coefficients.

Source : oai:HAL:hal-01337817v1

Volume: DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)

Section: Proceedings

Published on: January 1, 2015

Submitted on: November 21, 2016

Keywords: integer partitions,overpartitions,$q$-difference equations,recurrences,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 22 times.

This article's PDF has been downloaded 45 times.