Recent Comments
Advertisements
Category Archives: Teaching
Two Important Quantum Announcements!
I am very happy to announce two quantum events. First, I would like to announce a course “Computation, quantization, symplectic geometry, and information” in the first 2019/2020 semester at the Hebrew University of Jerusalem (HUJI). The course will by on … Continue reading
Bob Sedgewick’s Free Online Courses on Analysis of Algorithms and Analytic Combinatorics.
Philippe Flajolet 1948-2011 I am happy to forward the announcement on two free online courses (Mooks) by Bob Sedgewick Analysis of Algorithms and Analytic Combinatorics. Analysis of Algorithms page provides access to online lectures, lecture slides, and assignments for … Continue reading
International mathematics graduate studies at the Hebrew University of Jerusalem
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
Posted in Academics, Teaching, Updates
Tagged Einstein Institute of Mathematics, Graduate program, Updates
Leave a comment
Math and Physics Activities at HUJI
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
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
Leave a comment
Analysis of Boolean Functions – week 4
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
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
