A Refinement of the Crank-Mex Theorem
It is proved that the number of partitions of n with odd mex and k parts that aren't ones equals the number of partitions of n with nonnegative crank and k parts that aren't ones..
math.CO↗
arXiv subjects
Publications and source records attributed to George E Andrews.
It is proved that the number of partitions of n with odd mex and k parts that aren't ones equals the number of partitions of n with nonnegative crank and k parts that aren't ones..
Recently, Andrews, Dixit and Yee defined two partition functions $p_ω(n)$ and $p_ν(n)$ that are related with Ramanujan's mock theta functions $ω(q)$ and $ν(q)$, respectively. In this paper, we present two variable generalizations of their results. As an application, we reprove their results on $p_ω(n)$ and $p_ν(n)$ that are analogous to Euler's pentagonal number theorem.