On partition functions of Andrews and Stanley

Ae Ja Yee

doi:10.1016/j.jcta.2004.04.005

On partition functions of Andrews and Stanley

Ae Ja Yee

Mathematics

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

Andrews has established a refinement of the generating function for partitions π according to the numbers r(π) and s(π) of odd parts in π and the conjugate of π, respectively. In this paper, we derive a refined generating function for partitions into at most M parts less than or equal to N, which is a finite case of Andrew's refinement.

Original language	English (US)
Pages (from-to)	313-321
Number of pages	9
Journal	Journal of Combinatorial Theory. Series A
Volume	107
Issue number	2
DOIs	https://doi.org/10.1016/j.jcta.2004.04.005
State	Published - Aug 2004

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/j.jcta.2004.04.005

Cite this

@article{2826054e2aab41988edd99755121cb8b,

title = "On partition functions of Andrews and Stanley",

abstract = "Andrews has established a refinement of the generating function for partitions π according to the numbers r(π) and s(π) of odd parts in π and the conjugate of π, respectively. In this paper, we derive a refined generating function for partitions into at most M parts less than or equal to N, which is a finite case of Andrew's refinement.",

author = "Yee, \{Ae Ja\}",

note = "Funding Information: 1Research partially supported by a grant from the Number Theory Foundation.",

year = "2004",

month = aug,

doi = "10.1016/j.jcta.2004.04.005",

language = "English (US)",

volume = "107",

pages = "313--321",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - On partition functions of Andrews and Stanley

AU - Yee, Ae Ja

N1 - Funding Information: 1Research partially supported by a grant from the Number Theory Foundation.

PY - 2004/8

Y1 - 2004/8

N2 - Andrews has established a refinement of the generating function for partitions π according to the numbers r(π) and s(π) of odd parts in π and the conjugate of π, respectively. In this paper, we derive a refined generating function for partitions into at most M parts less than or equal to N, which is a finite case of Andrew's refinement.

AB - Andrews has established a refinement of the generating function for partitions π according to the numbers r(π) and s(π) of odd parts in π and the conjugate of π, respectively. In this paper, we derive a refined generating function for partitions into at most M parts less than or equal to N, which is a finite case of Andrew's refinement.

UR - https://www.scopus.com/pages/publications/3543071717

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

U2 - 10.1016/j.jcta.2004.04.005

DO - 10.1016/j.jcta.2004.04.005

M3 - Article

AN - SCOPUS:3543071717

SN - 0097-3165

VL - 107

SP - 313

EP - 321

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 2

ER -

On partition functions of Andrews and Stanley

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this