论文标题
迈向圆方法的自动化
Towards an automation of the circle method
论文作者
论文摘要
审查了$ n $分区数量的Hardy-Ramanujan-Rademacher公式的推导。接下来，检查了针对某些限制的分区或过度分类类别的类似公式的步骤，请记住如何在CAS中自动化这些计算。最后，呈现了许多借助\ emph {Mathematica}猜想的这种新公式，以及测试其数值准确性的结果。
The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartiitons is examined, bearing in mind how these calculations can be automated in a CAS. Finally, a number of new formulas of this type which were conjectured with the aid of \emph{Mathematica} are presented along with results of a test for their numerical accuracy.
