Dyson's transform

Freeman Dyson in 2005

Dyson's transform is a fundamental technique in additive number theory.^[1] It was developed by Freeman Dyson as part of his proof of Mann's theorem,^[2]: 17 is used to prove such fundamental results of Additive Number Theory as the Cauchy-Davenport theorem,^[1] and was used by Olivier Ramaré in his work on the Goldbach conjecture that proved that every even integer is the sum of at most 6 primes.^{[3]: 700–701} The term Dyson's transform for this technique is used by Ramaré.^{[3]: 700–701} Halberstam and Roth call it the τ-transformation.^[2]: 58

This formulation of the transform is from Ramaré.^{[3]: 700–701} Let A be a sequence of natural numbers, and x be any real number. Write A(x) for the number of elements of A which lie in [1, x]. Suppose ${\displaystyle A=\{a_{1}<a_{2}<\cdots \}}$ and ${\displaystyle B=\{0=b_{1}<b_{2}<\cdots \}}$ are two sequences of natural numbers. We write A + B for the sumset, that is, the set of all elements a + b where a is in A and b is in B; and similarly A − B for the set of differences a − b. For any element e in A, Dyson's transform consists in forming the sequences ${\displaystyle A'=A\cup \{B+\{e\}\}}$ and ${\displaystyle \,B'=B\cap \{A-\{e\}\}}$. The transformed sequences have the properties:

• ${\displaystyle A'+B'\subset A+B}$
• ${\displaystyle \{e\}+B'\subset A'}$
• ${\displaystyle 0\in B'}$
• ${\displaystyle A'(m)+B'(m-e)=A(m)+B(m-e)}$

References[]

This number theory-related article is a stub. You can help Wikipedia by .

• v
• t