Location of Repository

On Stanley's Partition Function

By William Y. C. Chen, Kathy Q. Ji and Albert J. W. Zhu

Abstract

Stanley defined a partition function t(n) as the number of partitions λ of n such that the number of odd parts of λ is congruent to the number of odd parts of the conjugate partition λ ′ modulo 4. We show that t(n) equals the number of partitions of n with an even number of hooks of even length. We derive a closed-form formula for the generating function for the numbers p(n) − t(n). As a consequence, we see that t(n) has the same parity as the ordinary partition function p(n). A simple combinatorial explanation of this fact is also provided

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.173.3266
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.combinatorics.org/V... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.