Recent Comments

Recent Posts
 Postoctoral Positions with Karim and Other Announcements!
 Jirka
 AviFest, AviStories and Amazing Cash Prizes.
 Polymath 10 post 6: The ErdosRado sunflower conjecture, and the Turan (4,3) problem: homological approaches.
 Polymath 10 Emergency Post 5: The ErdosSzemeredi Sunflower Conjecture is Now Proven.
 Mind Boggling: Following the work of Croot, Lev, and Pach, Jordan Ellenberg settled the cap set problem!
 More Math from Facebook
 The Erdős Szekeres polygon problem – Solved asymptotically by Andrew Suk.
 The Quantum Computer Puzzle @ Notices of the AMS
Top Posts & Pages
 Postoctoral Positions with Karim and Other Announcements!
 A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
 The Erdős Szekeres polygon problem  Solved asymptotically by Andrew Suk.
 Mind Boggling: Following the work of Croot, Lev, and Pach, Jordan Ellenberg settled the cap set problem!
 Polymath 10 Emergency Post 5: The ErdosSzemeredi Sunflower Conjecture is Now Proven.
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Believing that the Earth is Round When it Matters
 A Few Mathematical Snapshots from India (ICM2010)
 Amazing: Peter Keevash Constructed General Steiner Systems and Designs
RSS
Category Archives: Computer Science and Optimization
Jirka
The Mathematics of Jiří Matoušek is a conference taking place this week at Prague in memory of Jirka Matoušek. Here are the slides of my planned talk on Maestro Jirka Matoušek. This post presents the opening slides for the conference … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Conferences, Geometry, Obituary
Tagged Jirka Matoušek
4 Comments
AviFest, AviStories and Amazing Cash Prizes.
Ladies and gentlemen, a workshop in Princeton in honor of Avi Wigderson’s 60th birthday is coming on October. It will take place at Princeton on October 58 2016 right before FOCS 2016. Don’t miss the event ! Attendance is free but … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Conferences, Updates
Tagged Avi Wigderson
1 Comment
More Reasons for Small Influence
Readers of the bigleague ToC blogs have already heard about the breakthrough paper An averagecase depth hierarchy theorem for Boolean circuits by Benjamin Rossman, Rocco Servedio, and LiYang Tan. Here are blog reports on Computational complexity, on the Shtetl Optimized, and of Godel … Continue reading
New Isoperimetric Results for Testing Monotonicity
Muli, Dor and Subash, Jerusalem May 21 2015. Michel Talagrand Gregory Margulis Property testing In this post I will tell you about a new paper by Subhash Khot, Dor Minzer and Muli Safra entitled: On … Continue reading
Influence, Threshold, and Noise
My dear friend Itai Benjamini told me that he won’t be able to make it to my Tuesday talk on influence, threshold, and noise, and asked if I already have the slides. So it occurred to me that perhaps … Continue reading
NavierStokes Fluid Computers
Smart fluid Terry Tao posted a very intriguing post on the NavierStokes equation, based on a recently uploaded paper Finite time blowup for an averaged threedimensional NavierStokes equation. The paper proved a remarkable negative answer for the regularity conjecture for a certain … Continue reading
NatiFest is Coming
The conference Poster as designed by Rotem Linial A conference celebrating Nati Linial’s 60th birthday will take place in Jerusalem December 1618. Here is the conference’s webpage. To celebrate the event, I will reblog my very early 2008 post “Nati’s … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Conferences, Updates
Tagged Nati Linial
2 Comments
Analysis of Boolean Functions – Week 7
Lecture 11 The Cap Set problem We presented Meshulam’s bound for the maximum number of elements in a subset A of not containing a triple x,y,x of distinct elements whose sum is 0. The theorem is analogous to Roth’s theorem … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Teaching
Tagged Cap set problem, Codes, Linearity testing
Leave a comment
Analysis of Boolean Functions week 5 and 6
Lecture 7 First passage percolation 1) Models of percolation. We talked about percolation introduced by Broadbent and Hammersley in 1957. The basic model is a model of random subgraphs of a grid in ndimensional space. (Other graphs were considered later as … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Probability, Teaching
Tagged Arrow's theorem, Percolation
Leave a comment