- Proof By Lice!
- The seventeen camels riddle, and Noga Alon’s camel proof and algorithms
- Edmund Landau and the Early Days of the Hebrew University of Jerusalem
- Boolean Functions: Influence, Threshold, and Noise
- Laci Babai Visits Israel!
- Polymath10 conclusion
- Is Heads-Up Poker in P?
- The Median Game
- International mathematics graduate studies at the Hebrew University of Jerusalem
Top Posts & Pages
- The seventeen camels riddle, and Noga Alon's camel proof and algorithms
- Proof By Lice!
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Updates and plans III.
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- Emmanuel Abbe: Erdal Arıkan's Polar Codes
- Mind Boggling: Following the work of Croot, Lev, and Pach, Jordan Ellenberg settled the cap set problem!
- Combinatorics, Mathematics, Academics, Polemics, ...
- When It Rains It Pours
Category Archives: Teaching
I am very happy to announce that a Ph. D program in mathematics for international students at the Hebrew University of Jerusalem is now open. Here is the link to the home page. About the program The Einstein Institute of … Continue reading
Between 11-15 of September 2016 there will be a special mathematical workshop for excellent undergraduate students at the Hebrew University of Jerusalem. In parallel there will also be a workshop in physics. These workshops are aimed for second and third … Continue reading
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