Generalizing a partition theorem of Andrews

MaRDI QIDQ6286662zbMATH OpenFDO

Authors Shishuo Fu, Dazhao Tang

Publication date 14 May 2017

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83)

Abstract: Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated parts has exactly $j$ elements. These two sets of partitions turn out to be equinumerous, and this naturally encloses Euler's theorem and Andrews' theorem as two special cases. We give two proofs, one using generating function, and the other is a direct bijection that builds on Glaisher's bijection

Recommendations

• A bijection for partitions with initial repetitions
• On certain partition bijections related to Euler's partition problem
• On the combinatorics of the number of even parts in all partitions with distinct parts
• Identically distributed pairs of partition statistics
• Combinatorial proofs of two Euler-type identities due to Andrews

Cited in

(4)

• Glaisher's Partition problem
• Partition theorems and the Chinese remainder theorem
• Fixed perimeter analogues of some partition results
• A generalization of Franklin's partition identity and a Beck-type companion identity

This page was built for publication: Generalizing a partition theorem of Andrews

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