On the combinatorics of the number of even parts in all partitions with distinct parts
A famous theorem of Euler asserts that there are as many partitions of \(n\) into distinct parts as there are partitions into odd parts. The even parts in partitions of \(n\) into distinct parts play an important role in the Euler-Glaisher bijective proof of this result. \textit{G. E. Andrews} and the reviewer [Ann. Comb. 24, No. 1, 47--54 (2020; Zbl 1473.11190)] studied the number of even parts in all partitions of \(n\) and obtained some interesting properties. \textit{C. Ballantine} and the reviewer [Ramanujan J. 54, No. 1, 107--112 (2021; Zbl 1462.05027)] provided purely combinatorial proofs of these results. In this paper the author provided new bijective proofs of these identities introduced by Andrews and the reviewer.
- Combinatorial proofs of two theorems related to the number of even parts in all partitions of \(n\) into distinct parts
- Extensions and variations of Andrews-Merca identities
- On the number of even parts in all partitions of n into distinct parts
- A combinatorial proof for an identity involving partitions with distinct odd parts
- On a problem of George Andrews concerning partitions with even parts below odd parts
- A note on partitions into distinct parts and odd parts
- The dual form of Beck type identities
- Combinatorial proofs of two Euler-type identities due to Andrews
- On the number of even parts in all partitions of n into distinct parts
- On a problem of George Andrews concerning partitions with even parts below odd parts
- Note on partitions with even parts below odd parts
- Combinatorial proofs and refinements of three partition theorems of Andrews
- On the parity of the number of partitions of n into parts of two distinct sizes
- A combinatorial proof for an identity involving partitions with distinct odd parts
- Crossed partitions
- Partitions With Distinct Evens
- Bijecting Euler's Partitions-Recurrence
- Euler's partition theorem with upper bounds on multiplicities
- A note on a finite version of Euler's partition identity
- Euler's partition theorem
- ON THE SUM OF PARTS IN THE PARTITIONS OF n INTO DISTINCT PARTS
- On the sum of parts with multiplicity at least 2 in all the partitions of n
- New relations for the number of partitions with distinct even parts
- New identities for the polarized partitions and partitions with d-distant parts
- Refinement of some partition identities of Merca and Yee
- Balanced partitions
- Generalizing a partition theorem of Andrews
- Combinatorial proofs of theorems of Merca on the sum of different parts congruent to r modulo m in all partitions of n
- Rooted partitions and number-theoretic functions
- Euler's partition identity-finite version
- Even and odd compositions with restricted parts
- Identities involving partitions with distinct even parts and 4-regular partitions
- Combinatorial proofs of two theorems related to the number of even parts in all partitions of \(n\) into distinct parts
- A note on the partitions involving parts of \(k\) different magnitudes
This page was built for publication: On the combinatorics of the number of even parts in all partitions with distinct parts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052858)
