Combinatorial Telescoping for an Identity of Andrews on Parity in Partitions

Details Combinatorial Telescoping for an Identity of Andrews on Parity in Partitions Combinatorial Telescoping for an Identity of Andrews on Parity in Partitions

2011-06-15

arxiv.org/abs/1106.3013v1

Mathematics

Combinatorics

12 pages, 5 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Combinatorial Telescoping for an Identity of Andrews on Parity in Partitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial Telescoping for an Identity of Andrews on Parity in Partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Telescoping for an Identity of Andrews on Parity in Partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-659153