The mth Largest and mth Smallest Parts of a Partition

George E. Andrews, Greg Simay

Research output: Contribution to journalArticlepeer-review


The theory of overpartitions is applied to determine formulas for the number of partitions of n where (1) the mth largest part is k and (2) the mth smallest part is k.

Original languageEnglish (US)
Pages (from-to)635-640
Number of pages6
JournalAnnals of Combinatorics
Issue number4
StatePublished - Dec 1 2016

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'The mth Largest and mth Smallest Parts of a Partition'. Together they form a unique fingerprint.

Cite this