论文标题
分类最小的统一根总和
Classifying minimal vanishing sums of roots of unity
论文作者
论文摘要
如果没有适当的非空s子消失，则消失的团结根源称为最小。本文最多可以手工16个最小的重量统一根源分类，然后开发和编码算法以进一步扩展分类，最大的重量不超过21。
A vanishing sum of roots of unity is called minimal if no proper, nonempty sub-sum of it vanishes. This paper classifies all minimal vanishing sums of roots of unity of weight at most 16 by hand and then develops and codes an algorithm to extend the classification further, up to weight no greater than 21.
