go-v.orgdoi

On Stanley's Partition Function

William Y. C. Chen, Kathy Q. Ji, Albert J. W. Zhu · The Electronic Journal of Combinatorics · 2010

  • DOI 10.37236/480
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2010

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2010

Abstract

Stanley defined a partition function $t(n)$ as the number of partitions $\lambda$ of $n$ such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ 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.

Open the resolved locator · 10.37236/480

Metadata licence: OpenAlex metadata (CC0)