A central limit theorem for Gaussian polynomials and deterministic approximate counting for polynomial threshold functions

Computer Science/Discrete Mathematics Seminar II
Topic:A central limit theorem for Gaussian polynomials and deterministic approximate counting for polynomial threshold functions
Speaker:Anindya De
Affiliation:Member, School of Mathematics
Date:Tuesday, May 13
Time/Room:10:30am - 12:30pm/West Bldg. Lect. Hall
Video Link:http://video.ias.edu/csdm/2014/0513-AnindyaDe

In this talk, we will continue, the proof of the Central Limit theorem from my last talk. We will show that that the law of "eigenregular" Gaussian polynomials is close to a Gaussian. The proof will be based on Stein's method and will be dependent on using techniques from Malliavin calculus. We will also describe a new decomposition lemma for polynomials which says that any polynomial can be written as a function of small number of eigenregular polynomials. The techniques in the lemma are likely to be of independent interest. Based on joint work with Rocco Servedio.