2000 character limit reached
Overpartitions and singular overpartitions
Published 16 Feb 2017 in math.CO | (1702.04860v2)
Abstract: Singular overpartitions, which are defined by George Andrews, are overpartitions whose Frobenius symbols have at most one overlined entry in each row. In his paper, Andrews obtained interesting combinatorial results on singular overpartitions, one of which relates a certain type of singular overpartitions with a subclass of overpartitions. In this paper, we provide a combinatorial proof of Andrews' result, which answers to one of his open questions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.