### Recent Comments

dinostraurio on Seven Problems Around Tverberg… Matthew Cory on The Quantum Computer Puzzle @… Matthew Cory on The Quantum Computer Puzzle @… The Quantum Computer… on A Breakthrough by Maryna Viazo… The Quantum Computer… on Stefan Steinerberger: The Ulam… The Quantum Computer… on Polymath10-post 4: Back to the… Philip Gibbs on Stefan Steinerberger: The Ulam… Philip Gibbs on Stefan Steinerberger: The Ulam… Daniel on Stefan Steinerberger: The Ulam… Philip Gibbs on Stefan Steinerberger: The Ulam… Gil Kalai on Stefan Steinerberger: The Ulam… Gabriel Nivasch on Stefan Steinerberger: The Ulam… -
### Recent Posts

- The Erdős Szekeres polygon problem – Solved asymptotically by Andrew Suk.
- The Quantum Computer Puzzle @ Notices of the AMS
- Three Conferences: Joel Spencer, April 29-30, Courant; Joel Hass May 20-22, Berkeley, Jean Bourgain May 21-24, IAS, Princeton
- Math and Physics Activities at HUJI
- Stefan Steinerberger: The Ulam Sequence
- TYI 26: Attaining the Maximum
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- Polymath10-post 4: Back to the drawing board?
- News (mainly polymath related)

### Top Posts & Pages

- The Erdős Szekeres polygon problem - Solved asymptotically by Andrew Suk.
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- The Quantum Computer Puzzle @ Notices of the AMS
- Why Quantum Computers Cannot Work: The Movie!
- Three Conferences: Joel Spencer, April 29-30, Courant; Joel Hass May 20-22, Berkeley, Jean Bourgain May 21-24, IAS, Princeton
- Stefan Steinerberger: The Ulam Sequence
- Polymath10-post 4: Back to the drawing board?
- Believing that the Earth is Round When it Matters

### RSS

# Category Archives: Computer Science and Optimization

## Analysis of Boolean Functions – Week 3

Lecture 4 In the third week we moved directly to the course’s “punchline” – the use of Fourier-Walsh expansion of Boolean functions and the use of Hypercontractivity. Before that we started with a very nice discrete isoperimetric question on a … Continue reading

## Analysis of Boolean functions – week 2

Post on week 1; home page of the course analysis of Boolean functions Lecture II: We discussed two important examples that were introduced by Ben-Or and Linial: Recursive majority and tribes. Recursive majority (RM): is a Boolean function with variables … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Probability, Teaching
Tagged Boolean functions, Tribes
Leave a comment

## Analysis of Boolean Functions – week 1

Home page of the course. In the first lecture I defined the discrete n-dimensional cube and Boolean functions. Then I moved to discuss five problems in extremal combinatorics dealing with intersecting families of sets. 1) The largest possible intersecting family … Continue reading

## BosonSampling and (BKS) Noise Sensitivity

Update (Nov 2014): Noise sensitivity of BosonSampling and computational complexity of noisy BosonSampling are studied in this paper by Guy Kindler and me. Some of my predictions from this post turned out to be false. In particular the noisy BosonSampling … Continue reading

Posted in Computer Science and Optimization, Physics, Probability
Tagged BosonSampling, Noise, Noise-sensitivity, Quantum computation
8 Comments

## Lawler-Kozdron-Richards-Stroock’s combined Proof for the Matrix-Tree theorem and Wilson’s Theorem

David Wilson and a cover of Shlomo’s recent book “Curvature in mathematics and physics” A few weeks ago, in David Kazhdan’s basic notion seminar, Shlomo Sternberg gave a lovely presentation Kirchhoff and Wilson via Kozdron and Stroock. The lecture is based on … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Probability
Tagged David Wilson, Gustav Kirchhoff, Trees
4 Comments

## The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava

…while we keep discussing why mathematics is possible… The news Adam Marcus, Dan Spielman, and Nikhil Srivastava posted a paper entitled “Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem,” where they prove the 1959 Kadison-Singer conjecture. (We discussed part … Continue reading

## Why is mathematics possible?

Spectacular advances in number theory Last weeks we heard about two spectacular results in number theory. As announced in Nature, Yitang Zhang proved that there are infinitely many pairs of consecutive primes which are at most 70 million apart! This is a sensational achievement. … Continue reading

## QSTART

Physics, Computer Science, Mathematics, and Foundations’ views on quantum information Inauguration conference for the Quantum Information Science Center (QISC), Hebrew university of Jerusalem Update: The news of our conference have made it to a big-league blog. Update (July 2013): QStart … Continue reading

## My Quantum Debate with Aram III

This is the third and last post giving a timeline and some non technical highlights from my debate with Aram Harrow. Where were we After Aram Harrow and I got in touch in June 2011, and decided to have … Continue reading