The mth Largest and mth Smallest Parts of a Partition

George E. Andrews, Greg Simay

Research output: Contribution to journalArticle

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.

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

Fingerprint

Partition

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics

Cite this

@article{0c8ebde368cf4c378fe831b591c97e9a,
title = "The mth Largest and mth Smallest Parts of a Partition",
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.",
author = "Andrews, {George E.} and Greg Simay",
year = "2016",
month = "12",
day = "1",
doi = "10.1007/s00026-016-0333-x",
language = "English (US)",
volume = "20",
pages = "635--640",
journal = "Annals of Combinatorics",
issn = "0218-0006",
publisher = "Birkhauser Verlag Basel",
number = "4",

}

The mth Largest and mth Smallest Parts of a Partition. / Andrews, George E.; Simay, Greg.

In: Annals of Combinatorics, Vol. 20, No. 4, 01.12.2016, p. 635-640.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The mth Largest and mth Smallest Parts of a Partition

AU - Andrews, George E.

AU - Simay, Greg

PY - 2016/12/1

Y1 - 2016/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84991107034&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84991107034&partnerID=8YFLogxK

U2 - 10.1007/s00026-016-0333-x

DO - 10.1007/s00026-016-0333-x

M3 - Article

AN - SCOPUS:84991107034

VL - 20

SP - 635

EP - 640

JO - Annals of Combinatorics

JF - Annals of Combinatorics

SN - 0218-0006

IS - 4

ER -