What's transference you say ? Google says this. But I personally don't know, Terry Tao defines a transference principle:
This theorem does not directly apply to the prime numbers {\mathcal P}, as they have density zero, but it turns out that there is a trick (which Ben Green and I call the transference principle) which (very roughly speaking) lets one locate a dense set of integers A which “models” the primes, in the sense that there is a relationship between additive patterns in A and additive patterns in {\mathcal P}. (The relationship here is somewhat analogous to Monte Carlo integration, which uses the average value of a function f on a sparse set to approximate the average value of f on a much larger domain.) As a consequence of this principle, Ben and I were able to use Szemerédi’s theorem to establish that the primes contained arbitrarily long arithmetic progressions.
Primes number subsets, mmmhhh, it looks like an extension of his previous result. We'll see.
No comments:
Post a Comment