Combinatorial Applications of Möbius Inversion

Abstract

In important work on the parity of the partition function, Ono related values of the partition function to coefficients of a certain mock theta function modulo 2. In this paper, we use Möbius inversion to give analogous results which relate several combinatorial functions via identities rather than congruences.

Accepted for publication in Proceedings of the AMS

Cited by in corpus (1)

• The partition function $p(n)$ in terms of the classical Möbius function