arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0903.1297math.NTmath.CO
收藏

秩矩和曲柄矩的渐近性

Asymptotics for rank and crank moments

K. Bringmann, K. Mahlburg, R. Rhoades

摘要:

矩的分区排名和曲柄统计已研究其连接到组合对象,如杜尔菲符号,以及其连接到谐波马斯形式。本文证明了Bringmann和Mahlburg提出的一个猜想,该猜想改进了Garvan的一个猜想. Garvan猜想指出曲柄函数的矩总是大于秩函数的矩,即使这两个矩具有相同的主渐近项。证明使用的Hardy-Ramanujan方法,以提供精确的渐近估计的秩和曲柄力矩及其差异。

英文摘要:

Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves a conjecture due to Bringmann and Mahlburg that refined a conjecture of Garvan. Garvan's conjecture states that the moments of the crank function are always larger than the moments of the rank function, even though the moments have the same main asymptotic term. The proof uses the Hardy-Ramanujan method to provide precise asymptotic estimates for rank and crank moments and their differences.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑