On an Overpartition Analogue of $SOME(n)$
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915858534629376 |
|---|---|
| author | Gireesh, D. S. Hemanthkumar, B. |
| author_facet | Gireesh, D. S. Hemanthkumar, B. |
| contents | 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 $\overline{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 $\overline{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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_11105 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On an Overpartition Analogue of $SOME(n)$ Gireesh, D. S. Hemanthkumar, B. Combinatorics Number Theory 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 $\overline{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 $\overline{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. |
| title | On an Overpartition Analogue of $SOME(n)$ |
| topic | Combinatorics Number Theory |
| url | https://arxiv.org/abs/2603.11105 |