- Mathematical Gymnastics
- Media Item from “Haaretz” Today: “For the first time ever…”
- Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota’s Conjecture on Matroids
- Media items on David, Amnon, and Nathan
- Next Week in Jerusalem: Special Day on Quantum PCP, Quantum Codes, Simplicial Complexes and Locally Testable Codes
- Happy Birthday Ervin, János, Péter, and Zoli!
- My Mathematical Dialogue with Jürgen Eckhoff
- Test Your Intuition (23): How Many Women?
- Happy Birthday Richard Stanley!
Top Posts & Pages
- Believing that the Earth is Round When it Matters
- The Ultimate Riddle
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Meeting with Aram Harrow, and my Lecture on Why Quantum Computers Cannot Work.
- Amazing: Peter Keevash Constructed General Steiner Systems and Designs
- Why Quantum Computers Cannot Work: The Movie!
- Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota's Conjecture on Matroids
- Analysis of Boolean Functions
- The Intermediate Value Theorem Applied to Football
Category Archives: Teaching
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
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
Lecture 6 Last week we discussed two applications of the Fourier-Walsh plus hypercontractivity method and in this lecture we will discuss one additional application: The lecture was based on a 5-pages paper by Ehud Friedgut and Jeff Kahn: On the number … Continue reading
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
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
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
Alex Lubotzky and I are running together a year long course at HU on High Dimensional Expanders. High dimensional expanders are simplical (and more general) cell complexes which generalize expander graphs. The course is taking place in Room 110 of the mathematics building on … Continue reading
The renewed interest in this old post, reminded me of a more recent event: Question: In how many ways you can chose a committee of three students from a class of ten students? My expected answer: which is 120. Alternative … Continue reading
Here is a question from last year’s exam in the course “Basic Ideas of Mathematics”: You buy a toaster for 200 NIS ($50) and you are offered one year of insurance for 24 NIS ($6). a) Is it … Continue reading
This semester I am teaching an introductory course in mathematics for students in other departments. I taught a similar course last year entitled “Basic Ideas in Mathematics,” and this year, following a suggestion of my wife, I changed the name to “The Beauty of Mathematics”. Another … Continue reading