Counting Even and Odd Partitions

DOI10.2307/3647908MaRDI QIDQ4469194zbMATH OpenOpenAlexFDO

Authors Martin Klazar

Publication date 14 June 2004

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3647908

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Recommendations

• Parity bias in partitions
• scientific article; zbMATH DE number 2204089
• Parity successions in set partitions
• On the counting function of the sets of parts \(\mathcal A\) such that the partition function \(p(\mathcal {A},n)\) takes even values for \(n\) large enough
• The calculation for the partition number with odd or even part

Cited in

(9)

• Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
• Generalized Lambert series and Euler's pentagonal number theorem
• On a conjecture of Wilf
• Addition and counting: The arithmetic of partitions
• Partitions With Distinct Evens
• Wilf's conjecture
• A note on the generator subgraph of a graph
• New refinements of Narayana polynomials and Motzkin polynomials
• Parity reversing involutions on plane trees and 2-Motzkin paths

This page was built for publication: Counting Even and Odd Partitions

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