Combinatorial proofs of two theorems related to the number of even parts in all partitions of n into distinct parts
DOI10.1007/S11139-019-00184-7zbMATH Open1462.05027OpenAlexW2982227476WikidataQ113900583 ScholiaQ113900583MaRDI QIDQ829863FDOQ829863
Cristina Ballantine, Mircea Merca
Publication date: 6 May 2021
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-019-00184-7
Recommendations
- On the combinatorics of the number of even parts in all partitions with distinct parts
- The number of partitions with distinct even parts revisited
- On the number of even parts in all partitions of \(n\) into distinct parts
- Extensions and variations of Andrews-Merca identities
- Counting the parts divisible by k in all the partitions of n whose parts have multiplicity less than k
Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83)
Cites Work
Cited In (9)
- Title not available (Why is that?)
- On the combinatorics of the number of even parts in all partitions with distinct parts
- The dual form of Beck type identities
- Combinatorial proofs and generalizations of conjectures related to Euler's partition theorem
- On identities of Watson type
- On a class of \(N\)-parity partitions
- A Direct Proof of Two Theorems on Two-Line Partitions
- Combinatorial proofs of some enumeration identities
- Combinatorial proofs and refinements of three partition theorems of Andrews
This page was built for publication: Combinatorial proofs of two theorems related to the number of even parts in all partitions of \(n\) into distinct parts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q829863)
