Counting Even and Odd Partitions
Let \(\mathcal{S}_n\) be a family of combinatorial objects on the universe \([n]=\{1,2,\dots,n\}\). Assume that each \(X\in\mathcal{S}_n\) has integer-valued size \(s(X)\geq 0\). The characteristic \(S_n^\pm=\sum_{X\in\mathcal{S}_n} (-1)^{s(X)}\) of \(\mathcal{S}_n\) records the surplus of the objects with an even size over those with an odd size. In this note the author discusses four different kinds of combinatorial structures in the context of the exact and asymptotic enumeration of \(S_n^\pm\). Integer partitions, noncrossing set partitions, set partitions, and matchings and crossings are included. The generating function technique, an analytic continuation argument and the involution method are applied in a straightforward but elegant way in order to find convenient expressions for \(S_n^\pm\).
- 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
- 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)
