OpenAlex ·

Difference of the Sum of All Odd and Even Overlined Parts of Overpartitions

Nayandeep Deka Baruah and Pankaj Gogoi

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.21361
Original
Read it at the publisher
Topics
CombinatoricsNumber Theory

Abstract

Recently, Garvan and Sarma studied sums of non-overlined parts in overpartitions and partitions without repeated odd parts. In this paper, we study the corresponding statistic for overlined parts. We define $\mathrm{OSOME}(n)$ as the sum of all odd overlined parts minus the sum of all even overlined parts in the overpartitions of $n$. We obtain a closed form for its generating function and use it to prove congruences by elementary $q$-series methods, the theory of half-integral weight modular forms, and known congruences for the overpartition function.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Combinatorics

Get the few papers worth your time in Combinatorics every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics