Combinatorial telescoping for an identity of Andrews on parity in partitions

DOI10.1016/J.EJC.2011.10.010zbMATH Open1268.05025arXiv1106.3013OpenAlexW2011082840MaRDI QIDQ412243FDOQ412243

Charles B. Mei, Daniel K. Du, William Y. C. Chen

Publication date: 4 May 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the combinatorial objects corresponding to a sum of positive terms, we establish bijections that lead a telescoping relation. We illustrate this idea by giving a combinatorial telescoping relation for a classical identity of MacMahon. Recently, Andrews posed a problem of finding a combinatorial proof of an identity on the q-little Jacobi polynomials which was derived based on a recurrence relation. We find a combinatorial classification of certain triples of partitions and a sequence of bijections. By the method of cancelation, we see that there exists an involution for a recurrence relation that implies the identity of Andrews.

Full work available at URL: https://arxiv.org/abs/1106.3013

zbMATH Keywords

recurrence relationidentitycombinatorial telescopingq-little Jacobi polynomials

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Partition identities; identities of Rogers-Ramanujan type (11P84)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance
• The method of creative telescoping
• Parity in partition identities
• Producing new bijections from old
• The method of combinatorial telescoping

Cited In (2)

• Combinatorial proof of a partial theta function identity of Warnaar
• A combinatorial proof of a refinement of the Andrews-Olsson partition identity

This page was built for publication: Combinatorial telescoping for an identity of Andrews on parity in partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412243)