论文标题
由$p_ν（n）$列举的两个不同类别的分区之间的培训
A Bijection Between Two Different Classes of Partitions Enumerated by $p_ν(n)$
论文作者
论文摘要
在本文中，我们给出了一个纯粹的徒证明，两个不同的分区类都是分区函数的组合解释$p_ν（n）$，这是与第三阶模拟theta函数$ν（q）$相关的分区函数，都是等额的。这样，我们为安德鲁斯（Andrews）提出的组合问题提供了部分解决方案。
In this paper, we give a purely bijective proof that two different partition classes that are both combinatorial interpretations of the partition function $p_ν(n)$, a partition function related to the third order mock theta function $ν(q)$, are equinumerous. In doing so, we give a partial solution to a combinatorial problem proposed in a paper by Andrews.
