Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Sequences of odd length in strict partitions I: the combinatorics of double sum Rogers-Ramanujan type identities

Shishuo Fu, Haijun Li

Abstract

Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum $q$-series. Equipped with such a combinatorial set-up, we investigate a handful of double sum identities appeared in recent works of Cao-Wang, Wang-Wang, Wei-Yu-Ruan, Andrews-Uncu, Chern, and Wang, finding partition theoretical interpretations to all of these identities, and in most cases supplying Franklin-type involutive proofs. This approach dates back more than a century to P. A. MacMahon's interpretations of the celebrated Rogers-Ramanujan identities, and has been further developed by Kurşungöz in the last decade.

Sequences of odd length in strict partitions I: the combinatorics of double sum Rogers-Ramanujan type identities

Abstract

Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum -series. Equipped with such a combinatorial set-up, we investigate a handful of double sum identities appeared in recent works of Cao-Wang, Wang-Wang, Wei-Yu-Ruan, Andrews-Uncu, Chern, and Wang, finding partition theoretical interpretations to all of these identities, and in most cases supplying Franklin-type involutive proofs. This approach dates back more than a century to P. A. MacMahon's interpretations of the celebrated Rogers-Ramanujan identities, and has been further developed by Kurşungöz in the last decade.

Paper Structure

This paper contains 1 section, 2 theorems, 3 equations, 1 figure.

Table of Contents

  1. Introduction

Key Result

Theorem 1.1

For each $n\ge 1$,

Figures (1)

  • Figure :

Theorems & Definitions (2)

  • Theorem 1.1: Rogers-Ramanujan-MacMahon
  • Theorem 1.2