Group items tagged

However, it turns out that if one of the sets, say A, is sufficiently “uniform” or “pseudorandom”, then one can always solve this Goldbach-type problem, regardless of what the other two sets are. This type of fact is often established by Fourier-analytic means (or by closely related techniques, such as spectral theory), but let me give a heuristic combinatorial argument to indicate why one would expect this type of phenomenon to occur.

quares Primes Lagrange’s four square theorem: For every positive integer N, there exists a pattern in of the form . Vinogradov’s theorem: For every sufficiently large integer N, there exists a pattern in of the form . Fermat’s two square theorem: For every prime number , there exists a pattern in of the form . Even Goldbach conjecture: For every even number , there exists a pattern in of the form . Fermat’s four square theorem: There does not exist any pattern in of the form with . Green-Tao theorem: For any , there exist infinitely many patterns in of the form with . Pell’s equation: There are infinitely many patterns in of the form . Sophie Germain conjecture: There are infinitely many patterns in of the form .

MATH 254A : Topics in Ergodic Theory Course description: Basic ergodic theorems (pointwise, mean, maximal) and recurrence theorems (Poincare, Khintchine, etc.)  Topological dynamics.  Structural theory of measure-preserving systems; characteristic factors.  Spectral theory of dynamical systems.  Multiple recurrence theorems (Furstenberg, etc.) and connections with additive combinatorics (e.g. Szemerédi’s theorem).  Orbits in homogeneous spaces, especially nilmanifolds; Ratner’s theorem.  Further topics as time allows may include joinings, dynamical entropy, return times theorems, arithmetic progressions in primes, and/or

        Instructor: Terence Tao, tao@math.ucla.edu, x64844, MS 6183