Proof of the Andrews-Dyson-Rhoades conjecture on the spt-crank

From MaRDI portal
Publication:481675

DOI10.1016/J.AIM.2014.10.017zbMATH Open1318.11131arXiv1305.2116OpenAlexW1989097353WikidataQ123244015 ScholiaQ123244015MaRDI QIDQ481675FDOQ481675


Authors: William Y. C. Chen, Wenston J. T. Zang, Kathy Q. Ji Edit this on Wikidata


Publication date: 12 December 2014

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: The notion of the spt-crank of a vector partition, or an S-partition, was introduced by Andrews, Garvan and Liang. Let NS(m,n) denote the number of S-partitions of n with spt-crank m. Andrews, Dyson and Rhoades conjectured that NS(m,n)m is unimodal for any n, and they showed that this conjecture is equivalent to an inequality between the rank and the crank of ordinary partitions. They obtained an asymptotic formula for the difference between the rank and the crank of ordinary partitions, which implies NS(m,n)geqNS(m+1,n) for sufficiently large n and fixed m. In this paper, we introduce a representation of an ordinary partition, called the m-Durfee rectangle symbol, which is a rectangular generalization of the Durfee symbol introduced by Andrews. We give a proof of the conjecture of Andrews, Dyson and Rhoades by considering two cases. For mgeq1, we construct an injection from the set of ordinary partitions of n such that m appears in the rank-set to the set of ordinary partitions of n with rank not less than m. The case for m=0 requires five more injections. We also show that this conjecture implies an inequality between the positive rank and crank moments obtained by Andrews, Chan and Kim.


Full work available at URL: https://arxiv.org/abs/1305.2116




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Proof of the Andrews-Dyson-Rhoades conjecture on the spt-crank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q481675)