Refined counting of core partitions into D-distinct parts

Hannah E. Burson, Simone Sisneros-Thiry, Armin Straub

Research output: Contribution to journalArticlepeer-review

Abstract

Using a combinatorial bijection with certain abaci diagrams, Nath and Sellers have enumerated (s, ms ± 1)-core partitions into distinct parts. We generalize their result in several directions by including the number of parts of these partitions, by considering d-distinct partitions, and by allowing more general (s, ms ± r)-core partitions. As an application of our approach, we obtain the average and maximum number of parts of these core partitions.

Original languageEnglish (US)
Article numberP1.37
Pages (from-to)1-21
Number of pages21
JournalElectronic Journal of Combinatorics
Volume28
Issue number1
DOIs
StatePublished - 2021

Bibliographical note

Publisher Copyright:
© The authors.

Fingerprint

Dive into the research topics of 'Refined counting of core partitions into D-distinct parts'. Together they form a unique fingerprint.

Cite this