Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Metadata 
bibkey: aniceto2026identities
authors: Joselyne Aniceto, Cristina Ballantine
year: 2026
title: 'Identities involving the number of missing integers in partitions - combinatorial proofs'
doi: 10.48550/arXiv.2608.00278
url: https://arxiv.org/abs/2608.00278v1
claim: "The Conclusion retains the overpartition analogue of Bhoria–Eyyunni–Santra Theorem 2.9 as an open problem."
strata_touched:
  - D5/S3/Combinatorics/Partitions/OverpartitionThreshold
license: citation-only
triage: anchor

Identities involving the number of missing integers in partitions - combinatorial proofs

The Conclusion states:

It is still an open problem to find combinatorial proofs of their congruences as well as an analog for overpartitions of Theorem 3.5 [3, Theorem 2.9].

Here Theorem 3.5 is the ordinary-partition threshold identity. The distinct congruence-proof questions are not the same problem as its requested overpartition analogue.

Verified locator

DOI: 10.48550/arXiv.2608.00278

URL: https://arxiv.org/abs/2608.00278v1

Locator: https://arxiv.org/html/2608.00278v1 , Conclusion.