论文标题
一种通过符号计算来验证分区一致性的方法
A Method of Verifying Partition Congruences by Symbolic Computation
论文作者
论文摘要
即使使用计算机，涉及无限分区一致性家庭的猜想也很难验证许多个别情况。我们演示了如何修改RADU算法的机械，以有效地检查大量这种猜想的情况。在尝试完整的证据之前，这允许为给定的猜想收集大量证据。
Conjectures involving infinite families of restricted partition congruences can be difficult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modified and employed to efficiently check a very large number of cases of such conjectures. This allows substantial evidence to be collected for a given conjecture, before a complete proof is attempted.
