Recent Comments
Matthew D Cory on November’s Lectures, 202… jamesmessig on November’s Lectures, 202… Gil Kalai on Quantum Computers: A Brief Ass… Quantum Computers: A… on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… jamesmessig on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… Gil Kalai on November’s Lectures, 202… jamesmessig on November’s Lectures, 202… Gil Kalai on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… -
Recent Posts
- Combinatorial Morning in Tel Aviv, Sunday 28/12/2025
- November’s Lectures, 2025
- Ten Recent Questions for ChatGPT
- A Visit to the Israeli Quantum Computing Center (IQCC)
- Computational Complexity and Explanations in Physics
- Kazhdan Seminar fall 2025 – Starting Today Oct. 19, 2026.
- Explicit Lossless Vertex Expanders!
- Dror Bar-Natan and Roland Van der Veen – A Fast, Strong, and Fun knot invariant!
- Polynomial Bounds for Chowla’s Cosine Problem
Top Posts & Pages
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- Combinatorial Morning in Tel Aviv, Sunday 28/12/2025
- TYI 30: Expected number of Dice throws
- Hong Wang and Joshua Zahl's Solution for the Kakeya Problem in Three Dimensions - Reflections and Links
- What is the maximum number of Tverberg's partitions?
- ChatGPT Meets Elchanan Mossel's Dice Problem
- Navier-Stokes Fluid Computers
- Seven Problems Around Tverberg's Theorem
- Touching Simplices and Polytopes: Perles' argument
RSS
Monthly Archives: October 2013
More around Borsuk
Piotr Achinger told me two things abour Karol Borsuk: From Wikipedea: Dunce hat Folding. The blue hole is only for better view Borsuk trumpet is another name for the contractible non-collapsible space commonly called also the “dunce hat“. (See … Continue reading
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 n-dimensional space. (Other graphs were considered later as … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Probability, Teaching
Tagged Arrow's theorem, Percolation
1 Comment