Pith. sign in

REVIEW

Overpartitions and singular overpartitions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1702.04860 v2 pith:RCZUAOHG submitted 2017-02-16 math.CO

Overpartitions and singular overpartitions

classification math.CO
keywords overpartitionssingularandrewscombinatorialanswerscertaindefinedentry
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.