Papers
Topics
Authors
Recent
Search
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.

Citations (2)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.