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

Andrews与Newman的扩展最小排除项的推广

Generalization of the Extended Minimal Excludant of Andrews and Newman

Aritram Dhar, Avi Mukhopadhyay, Rishabh Sarma

AI总结:

本文推广Andrews与Newman的扩展mex分拆函数,建立其与任意rank、crank界分拆数的联系,给出最小部分函数的有限和表达式及受限分拆恒等式,并引入overpartition的新mex。

摘要:

在最近一项开创性工作中,Andrews和Newman定义了其分拆函数最小排除项(即“mex”)的扩展函数$p_{A,a}(n)$。通过考察特殊情形$p_{k,k}(n)$和$p_{2k,k}(n)$,他们揭示了该函数与分拆的rank和crank以及某些受限分拆之间的联系。本文在他们工作的基础上,获得了更一般的结果,将扩展mex函数与一个整数在rank和crank上具有任意界的分拆数联系起来。我们还导出了一个新结果,将Andrews的最小部分函数表示为所考虑的扩展mex函数带有一个奇妙系数的有限和。我们还得到了若干受限分拆恒等式,其中一些令人联想到移位分拆恒等式。最后,我们定义并研究了一种针对overpartition的新的最小排除项。

英文摘要:

In a recent pioneering work, Andrews and Newman defined an extended function $p_{A,a}(n)$ of their minimal excludant or "mex" of a partition function. By considering the special cases $p_{k,k}(n)$ and $p_{2k,k}(n)$, they unearthed connections to the rank and crank of partitions and some restricted partitions. In this paper, we build on their work and obtain more general results associating the extended mex function with the number of partitions of an integer with arbitrary bound on the rank and crank. We also derive a new result expressing the smallest parts function of Andrews as a finite sum of the extended mex function in consideration with a curious coefficient. We also obtain a few restricted partition identities with some reminiscent of shifted partition identities. Finally, we define and explore a new minimal excludant for overpartitions.

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

↑