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

A rank of partitions with overline designated summands

Robert. X. J. Hao, Erin Y. Y. Shen, Wenston J. T. Zang

英文摘要:

Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. In a recent work, Lin studied a partition function $PD_{t}(n)$ which counts the number of tagged parts over all the partitions of $n$ with designated summands. He proved that $PD_{t}(3n+2)$ is divisible by $3$. In this paper, we first introduce a structure named partitions with overline designated summands, which is counted by $PD_t(n)$. We then define a generalized rank of partitions with overline designated summands and give a combinatorial interpretation of the congruence for $PD_t(3n+2)$.

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

↑