On the Number of Parts of Integer Partitions Lying in Given Residue Classes

Olivia Beckwith; Michael H. Mertens

doi:10.1007/s00026-017-0363-z

On the Number of Parts of Integer Partitions Lying in Given Residue Classes

Olivia Beckwith, Michael H. Mertens^*

^*Corresponding author for this work

Research output: Contribution to journal › Article (Academic Journal) › peer-review

3 Citations (Scopus)

Abstract

Improving upon previous work [3] on the subject, we use Wright’s Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer n that are in any given arithmetic progression.

Original language	English
Pages (from-to)	507-517
Number of pages	11
Journal	Annals of Combinatorics
Volume	21
Issue number	4
Early online date	5 Aug 2017
DOIs	https://doi.org/10.1007/s00026-017-0363-z
Publication status	Published - 1 Dec 2017

Keywords

asymptotics
circle method
parts in partitions

Access to Document

10.1007/s00026-017-0363-z

https://arxiv.org/abs/1602.03761

Handle.net

Persistent link

Cite this

@article{5662c133d72a4ccd9a38066e4d60e060,

title = "On the Number of Parts of Integer Partitions Lying in Given Residue Classes",

abstract = "Improving upon previous work [3] on the subject, we use Wright{\textquoteright}s Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer n that are in any given arithmetic progression.",

keywords = "asymptotics, circle method, parts in partitions",

author = "Olivia Beckwith and Mertens, {Michael H.}",

year = "2017",

month = dec,

day = "1",

doi = "10.1007/s00026-017-0363-z",

language = "English",

volume = "21",

pages = "507--517",

journal = "Annals of Combinatorics",

issn = "0218-0006",

publisher = "Springer International Publishing AG",

number = "4",

}

TY - JOUR

T1 - On the Number of Parts of Integer Partitions Lying in Given Residue Classes

AU - Beckwith, Olivia

AU - Mertens, Michael H.

PY - 2017/12/1

Y1 - 2017/12/1

N2 - Improving upon previous work [3] on the subject, we use Wright’s Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer n that are in any given arithmetic progression.

AB - Improving upon previous work [3] on the subject, we use Wright’s Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer n that are in any given arithmetic progression.

KW - asymptotics

KW - circle method

KW - parts in partitions

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

U2 - 10.1007/s00026-017-0363-z

DO - 10.1007/s00026-017-0363-z

M3 - Article (Academic Journal)

AN - SCOPUS:85026821134

VL - 21

SP - 507

EP - 517

JO - Annals of Combinatorics

JF - Annals of Combinatorics

SN - 0218-0006

IS - 4

ER -

On the Number of Parts of Integer Partitions Lying in Given Residue Classes

Abstract

Keywords

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this