PreprintCC BY-NC-SA 4.0arXiv
Asymptotic and Arithmetic Aspects of Generalized Colored Overpartitions
Abstract
Colored partitions constitute a well-established and extensively studied area of research with numerous generalizations arising from imposing restrictions on the allowed colors of the parts. In particular, restricted colored partitions have received considerable attention owing to their rich combinatorial and arithmetic properties. Motivated by these developments, we consider a colored overpartition function C̅m,r,s(n), which enumerates the overpartitions of n such that each part divisible by m can be assigned any of r colors, while each part not divisible by m may be assigned any of s colors. We investigate an asymptotic formula and several arithmetic properties of this function, including its density properties.
Related
- Internal congruences modulo powers of 2 for k-colored overpartitions into odd parts
- Asymptotic Formula for Biregular Overpartitions
- Laurent coefficients of Zagier-type zeta function {à} la Ishibashi and arithmetic aspects of extended Ramanujan period function
- Proof of a Conjecture of Cui, Gu and Tang on 18-Colored Generalized Frobenius Partitions
- Asymptotic monoids of words and logarithmic-prefix functionals for divergent arithmetic products
BibTeX
@misc{anakha2026asymptotic,
title = {{Asymptotic and Arithmetic Aspects of Generalized Colored Overpartitions}},
author = {Anakha V and Chiranjit Ray},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.39697},
eprint = {2609.39697},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39697},
note = {CC BY-NC-SA 4.0},
}
RIS
TY - UNPB
TI - Asymptotic and Arithmetic Aspects of Generalized Colored Overpartitions
AU - Anakha V
AU - Chiranjit Ray
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.39697
UR - https://arxiv.org/abs/2609.39697
AB - Colored partitions constitute a well-established and extensively studied area of research with numerous generalizations arising from imposing restrictions on the allowed colors of the parts. In particular, restricted colored partitions have received considerable attention owing to their rich combinatorial and arithmetic properties. Motivated by these developments, we consider a colored overpartition function C̅_m,r,s(n), which enumerates the overpartitions of n such that each part divisible by m can be assigned any of r colors, while each part not divisible by m may be assigned any of s colors. We investigate an asymptotic formula and several arithmetic properties of this function, including its density properties.
ER -