English

On an Overpartition Analogue of $SOME(n)$

Combinatorics 2026-03-16 v2 Number Theory

Abstract

Recently, Andrews and Dastidar introduced the partition function SOME(n)SOME(n), defined as the sum of all the odd parts in the partitions of nn minus the sum of all the even parts in the partitions of nn. They derived its generating function and established some congruences satisfied by SOME(n)SOME(n). In this paper, we introduce an overpartition analogue of SOME(n)SOME(n), denoted by SOME(n)\overline{SOME}(n), the sum of all the odd parts in the overpartitions of nn minus the sum of all the even parts in the overpartitions of nn. We derive the generating function for SOME(n)\overline{SOME}(n) and obtain congruences modulo 3, 53, \ 5 and powers of 22. Our method is based on classical qq-series identities and manipulations of infinite products and sums.

Keywords

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}
}