Abstract: Singular overpartitions, which are defined by George Andrews, are overpartitions whose Frobenius symbols have at most one overlined entry in each row. In his paper, Andrews obtained interesting combinatorial results on singular overpartitions, one of which relates a certain type of singular overpartitions with a subclass of overpartitions. In this paper, we provide a combinatorial proof of Andrews' result, which answers to one of his open questions.
Recommendations
Cited in
(8)- Investigation of norms of overpartitions
- Combinatorial proofs of the Ramanujan type congruences modulo \(3\)
- Enumeration of partitions with prescribed successive rank parity blocks
- On the number of l-regular overpartitions
- Multiplicity and number of parts in overpartitions
- Singular overpartitions
- A partition statistic for partitions with even parts distinct
- Singular overpartitions and partitions with prescribed hook differences
This page was built for publication: Overpartitions and singular overpartitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1644643)