Skip to main content

Home/ ErgodicPNT/ Group items tagged dichotomy

Rss Feed Group items tagged

arithwsun arithwsun

Structure and randomness in combinatorics « What's new - 0 views

  •  
    I've just uploaded to the arXiv my lecture notes "Structure and randomness in combinatorics" for my tutorial at the upcoming FOCS 2007 conference in October. This tutorial covers similar ground as my ICM paper (or slides), or my first two Simons lectures, but focuses more on the "nuts-and-bolts" of how structure theorems actually work to separate objects into structured pieces and pseudorandom pieces, for various definitions of "structured" and "pseudorandom".  Given that the target audience consists of computer scientists, I have focused exclusively here on the combinatorial aspects of this dichotomy (applied for instance to functions on the Hamming cube) rather than, say, the ergodic theory aspects (which are covered in Bryna Kra's lecture notes from Montreal, or my notes from Montreal for that matter).  While most of the known applications of these decompositions are number-theoretic (e.g. my theorem with Ben Green), the number theory aspects are not covered in detail in these notes.  (For that, you can read Bernard Host's Bourbaki article, Ben Green's http
arithwsun arithwsun

[math/0512114] The dichotomy between structure and randomness, arithmetic progressions,... - 0 views

  •  
    Rather than give another exposition of this result, we have chosen to take a broader view, surveying the collection of structural theorems which underlie the proof of such results as Theorem 1.1 and Theorem 1.2.
1 - 3 of 3
Showing 20 items per page