Combinatorial proofs of two theorems related to the number of even parts in all partitions of n into distinct parts
From MaRDI portal
(Redirected from Publication:829863)
Combinatorial proofs of two theorems related to the number of even parts in all partitions of \(n\) into distinct parts
Combinatorial proofs of two theorems related to the number of even parts in all partitions of \(n\) into distinct parts
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
Cites work
Cited in
(15)- Combinatorial proofs and generalizations of conjectures related to Euler's partition theorem
- Combinatorial proofs of some enumeration identities
- On the combinatorics of the number of even parts in all partitions with distinct parts
- Combinatorial proofs of theorems of Merca on the sum of different parts congruent to $r$ modulo $m$ in all partitions of $n$
- On a problem of George Andrews concerning partitions with even parts below odd parts
- On identities of Watson type
- On the sum of parts with multiplicity at least \(2\) in all the partitions of \(n\)
- A combinatorial proof of a partition perimeter inequality
- Combinatorial proofs and refinements of three partition theorems of Andrews
- On a class of \(N\)-parity partitions
- The dual form of Beck type identities
- A Direct Proof of Two Theorems on Two-Line Partitions
- A combinatorial proof for an identity involving partitions with distinct odd parts
- scientific article; zbMATH DE number 2204089 (Why is no real title available?)
- A further look at the sum of the parts with the same parity in the partitions of \(n\)
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)