On an Overpartition Analogue of $SOME(n)$
Combinatorics
2026-03-16 v2 Number Theory
Abstract
Recently, Andrews and Dastidar introduced the partition function , defined as the sum of all the odd parts in the partitions of minus the sum of all the even parts in the partitions of . They derived its generating function and established some congruences satisfied by . In this paper, we introduce an overpartition analogue of , denoted by , the sum of all the odd parts in the overpartitions of minus the sum of all the even parts in the overpartitions of . We derive the generating function for and obtain congruences modulo and powers of . Our method is based on classical -series identities and manipulations of infinite products and sums.
Cite
@article{arxiv.2603.11105,
title = {On an Overpartition Analogue of $SOME(n)$},
author = {D. S. Gireesh and B. Hemanthkumar},
journal= {arXiv preprint arXiv:2603.11105},
year = {2026}
}