arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.03329math.COmath.NT

Mock theta 函数及相关组合数学

Mock theta functions and related combinatorics

Cristina Ballantine, Hannah E. Burson, Amanda Folsom, Chi-Yun Hsu, Isabella Negrini, Boya Wen

AI总结:

本文受 Beck 猜想启发,针对三阶 mock theta 函数 $ω(q)$、$ν(q)$ 和 $ϕ(q)$,用生成函数与组合双射建立 Beck 型分拆恒等式。

摘要:

本文丰富了关于 mock theta 函数组合性质的文献;mock theta 函数是 Ramanujan 于1920年致 Hardy 的最后一封信中引入的一组奇妙的 $q$-超几何级数,如今我们知道它们是 mock 模形式的重要例子。我们的工作受到 Beck 猜想的启发,该猜想现已成为 Andrews 的定理,并与 Euler 恒等式有关:在 $n$ 的所有奇数分拆中,部件总数相对于 $n$ 的互异分拆数的超出量,等于只有一个偶数部件(可重复)而所有其他部件均为奇数的分拆数。我们针对三阶 mock theta 函数 $ω(q)$、$ν(q)$ 和 $ϕ(q)$,建立了与 Andrews、Dixit 和 Yee 给出的分拆恒等式相关的 Beck 型恒等式。我们的证明在性质上兼具解析性与组合性,并涉及 mock theta 生成函数和组合双射。

英文摘要:

In this paper we add to the literature on the combinatorial nature of the mock theta functions, a collection of curious $q$-hypergeometric series introduced by Ramanujan in his last letter to Hardy in 1920, which we now know to be important examples of mock modular forms. Our work is inspired by Beck's conjecture, now a theorem of Andrews, related to Euler's identity: the excess of the number of parts in all partitions of $n$ into odd parts over the number of partitions of $n$ into distinct parts is equal to the number of partitions with only one (possibly repeated) even part and all other parts odd. We establish Beck-type identities associated to partition identities due to Andrews, Dixit, and Yee for the third order mock theta functions $ω(q), ν(q)$, and $ϕ(q)$. Our proofs are both analytic and combinatorial in nature, and involve mock theta generating functions and combinatorial bijections.

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

↑