On an Overpartition Analogue of SOME(n)
Abstract
Recently, Andrews and Dastidar introduced the partition function SOME(n), defined as the sum of all the odd parts in the partitions of n minus the sum of all the even parts in the partitions of n. They derived its generating function and established some congruences satisfied by \(SOME(n)\). In this paper, we introduce an overpartition analogue of SOME(n), denoted by SOME(n), the sum of all the odd parts in the overpartitions of \(n\) minus the sum of all the even parts in the overpartitions of \(n\). We derive the generating function for SOME(n) and obtain congruences modulo \(3, \ 5\) and powers of \(2\). Our method is based on classical q-series identities and manipulations of infinite products and sums.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.