Enumeration of partitions with prescribed successive rank parity blocks

DOI10.1016/J.JCTA.2018.03.004zbMath1391.05033arXiv1703.07507OpenAlexW2962786866WikidataQ130117322 ScholiaQ130117322MaRDI QIDQ721040

Ae Ja Yee, Seung-Hyun Seo

Publication date: 18 July 2018

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.07507

zbMATH Keywords

partitionsDyck pathssuccessive rankssingular overpartitionsFrobenius symbolsposet-partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items (4)

Truncated versions of three identities of Euler and Gauss ⋮ Counting lattice paths by crossings and major index I: the corner-flipping bijections ⋮ Singular overpartitions and partitions with prescribed hook differences ⋮ New truncated theorems for three classical theta function identities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The truncated pentagonal number theorem
• q-Catalan numbers
• Partitions with prescribed hook differences
• Extension of the partition sieve
• Overpartitions and singular overpartitions
• Combinatorial proofs of generating function identities for F-partitions
• Singular overpartitions
• Generalized Frobenius partitions
• A NOTE ON RANKS AND CONJUGACY OF PARTITIONS
• Sieves in the Theory of Partitions
• Some Properties of Partitions

This page was built for publication: Enumeration of partitions with prescribed successive rank parity blocks