Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Conway–Jones: trigonometric Diophantine equations and vanishing sums


Held copy and library card.

J. H. Conway and A. J. Jones, "Trigonometric diophantine equations (On vanishing sums of roots of unity)," Acta Arithmetica 30 (1976), no. 3, 229--240.

Conway and Jones develop a finite procedure for describing rational linear relations among roots of unity and classify vanishing sums of length at most nine. Their main quantitative result for the present problem is Theorem 5: if a minimal vanishing sum has length ll and reduced exponent rr, then

l≥2+∑p∣r(p−2).l \ge 2 + \sum_{p\mid r}(p-2).

Thus every additional prime appearing in a minimal relation has an explicit support cost. Theorem 4 (p. 234) splits a vanishing sum SS that is not similar to 1+ω+⋯+ωr−11+\omega+\cdots+\omega^{r-1} (rr prime, ω\omega a primitive rrth root) into two vanishing sums S′+S′′S'+S'' with l(S′)≤l(S)l(S')\le l(S), r(S′)<r(S)r(S')<r(S), l(S′′)<l(S)l(S'')<l(S), r(S′′)≤r(S)r(S'')\le r(S), and Theorem 6 gives concrete normal forms through length nine.

For E0774, Theorem 5 is a sharp way to rule out short signed relations whose reduced exponent contains too many or too-large prime factors. It can support a prime-coordinate construction or an analysis of the T195T_{195} test case. It does not by itself control how many mutually interacting minimal relations occur in a finite set, so a proportional extraction or coloring argument still needs an additional combinatorial step.