Abstract
In 2014, as part of a larger study of overpartitions with restrictions of the overlined parts based on residue classes, Munagi and Sellers [Util. Math. 95 (2014) 33–49] defined d2(n) as the number of overpartitions of weight n wherein only even parts can be overlined. As part of that work, they used a generating function approach to prove a parity characterization for d2(n). In this article, we give a combinatorial proof of their result and extend it to a modulus four characterization; we provide both generating function and combinatorial proofs of this stronger result. The combinatorial arguments incorporate classical bijections of Franklin, Glaisher, and Sylvester.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 95-102 |
| Number of pages | 8 |
| Journal | Discrete Mathematics Letters |
| Volume | 14 |
| DOIs | |
| State | Published - 2024 |
Bibliographical note
Publisher Copyright:© 2024 the authors.
Keywords
- bijection
- combinatorial proof
- congruence
- generating function
- overpartition
- partition
Fingerprint
Dive into the research topics of 'Enumeration modulo four of overpartitions wherein only even parts may be overlined'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS