Overpartitions with repeated smallest non-overlined part
Abstract
Inspired by Andrews' and Bachraoui's work on partitions with repeated smallest part, we extend the concept to overpartitions. We study overpartitions with the restriction that the smallest non-overlined part appears exactly k times and every overlined part is bigger than this part. We prove results expressing the generating functions of these overpartitions (and their subclass where no part has the same parity as the smallest part, among others) as linear combinations of the q-Pochhammer symbols with rational functions in q as coefficients.
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.