Skip to main content
SpringerLink
Log in

The mth Largest and mth Smallest Parts of a Partition

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Corteel S., Lovejoy J.: Overpartitions. Trans. Amer. Math. Soc. 356, 1623–1635 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. MacMahon, P.A.: Combinatory Analysis, Vol. II. Cambridge University Press, Cambridge (1918)

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The Pennsylvania State University, University Park, PA, 16802, USA

    George E. Andrews

  2. 8010 W. US 223, Adrian, MI, 49221, USA

    Greg Simay

Authors
  1. George E. Andrews
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Greg Simay
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George E. Andrews.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Andrews, G.E., Simay, G. The mth Largest and mth Smallest Parts of a Partition. Ann. Comb. 20, 635–640 (2016). https://doi.org/10.1007/s00026-016-0333-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-016-0333-x

Mathematics Subject Classification

Keywords

Search

Navigation