A Bijection Between Two Different Classes of Partitions Enumerated by $p_\nu(n)$
Combinatorics
2020-07-21 v1 Number Theory
Abstract
In this paper, we give a purely bijective proof that two different partition classes that are both combinatorial interpretations of the partition function , a partition function related to the third order mock theta function , are equinumerous. In doing so, we give a partial solution to a combinatorial problem proposed in a paper by Andrews.
Cite
@article{arxiv.2007.09794,
title = {A Bijection Between Two Different Classes of Partitions Enumerated by $p_\nu(n)$},
author = {A. S. Andersen},
journal= {arXiv preprint arXiv:2007.09794},
year = {2020}
}