On partition functions of Andrews and Stanley

Research output: Contribution to journalArticlepeer-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 languageEnglish (US)
Pages (from-to)313-321
Number of pages9
JournalJournal of Combinatorial Theory. Series A
Volume107
Issue number2
DOIs
StatePublished - Aug 2004

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'On partition functions of Andrews and Stanley'. Together they form a unique fingerprint.

Cite this