Infinite families of crank functions, Stanton-type conjectures, and unimodality (Q2146916)

While Dyson's rank function [\textit{F. J. Dyson}, in: Ramanujan revisited, Proc. Conf., Urbana-Champaign/Illinois 1987, 7--28 (1988; Zbl 0652.10009)] and the Andrews-Garvan crank function [\textit{G. E. Andrews} and \textit{F. G. Garvan}, Bull. Am. Math. Soc., New Ser. 18, No. 2, 167--171 (1988; Zbl 0646.10008)] distribute partitions into congruence classes of equal size in order to explain Ramanujan's congruences, there is no known direct map between these equinumerous classes. Stanton recently made conjectures which aim to uncover a deeper combinatorial structure along these lines, where it turns out that minor modifications of the rank and crank are required. In this paper, the authors prove two of these conjectures and extend Stanton's conjecture to an infinite family of cranks.