Category Archives: Teaching

Starting Today: Kazhdan Sunday seminar: “Boolean Functions, Hypercontractivity, and Applications”

Posted on March 22, 2026 by Gil Kalai

Sunday, 22 March, 2026 – 11:00 to 13:00 Today the seminar will take place via zoom. After Pesach we hope to make it in Ross 70 seminar room.   Repeats every week every Sunday until the end of June 2026 Kazhdan … Continue reading →

Posted in Analysis, Combinatorics, Computer Science and Optimization, Teaching | Tagged , , | 9 Comments

Three games to cheer you up.

Posted on October 11, 2020 by Gil Kalai

Here are three cool games prepared by students of my 2020 Game Theory class. Enjoy! (More games will come later. See this post for an earlier game.) Four-in -a-row with HEX board by: Daniella Drori, Margot Guetta, Eyal Magen and … Continue reading →

Posted in Games, Teaching | 1 Comment

Harsanyi’s Sweater

Posted on April 21, 2020 by Gil Kalai

Today is the Holocaust Remembrance Day in Israel.  Here is a moving story from the  paper  about  John Harsanyi,  Harsanyi’s Sweater, by Robert J. Aumann. It is 1944 in Budapest, and John is in his early twenties. He has been … Continue reading →

Posted in Games, Teaching | Tagged , | Leave a comment

Game Theory – on-line Course at IDC, Herzliya

Posted on March 29, 2020 by Gil Kalai

Game theory, a graduate course at IDC, Herzliya; Lecturer: Gil Kalai; TA: Einat Wigderson,  ZOOM mentor: Ethan. Starting Tuesday March 31, I am giving an on-line course (in Hebrew) on Game theory at IDC, Herzliya (IDC English site; IDC Chinese … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Economics, Games, Rationality, Teaching | Tagged , | 2 Comments

Starting today: Kazhdan Sunday seminar: “Computation, quantumness, symplectic geometry, and information”

Posted on October 27, 2019 by Gil Kalai

Sunday, 27 October, 2019 – 14:00 to 16:00 Repeats every week every Sunday until Sat Feb 01 2020 Location: Ross 70 See also: Seminar announcement; previous post Symplectic Geometry, Quantization, and Quantum Noise. The Google supremacy claims are discussed (with … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Geometry, Physics, Teaching | Tagged , , , | 3 Comments

Two Important Quantum Announcements!

Posted on August 9, 2019 by Gil Kalai

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 →

Posted in Computer Science and Optimization, Conferences, Quantum, Teaching | Tagged , , , , | 8 Comments

Bob Sedgewick’s Free Online Courses on Analysis of Algorithms and Analytic Combinatorics.

Posted on March 2, 2019 by Gil Kalai

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 →

Posted in Combinatorics, Computer Science and Optimization, Teaching, Updates | Tagged , | Leave a comment

International mathematics graduate studies at the Hebrew University of Jerusalem

Posted on January 10, 2017 by Gil Kalai

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 , , | Leave a comment

Math and Physics Activities at HUJI

Posted on April 18, 2016 by Gil Kalai

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 →

Posted in Teaching, Updates | Tagged | Leave a comment

Analysis of Boolean Functions – Week 7

Posted on October 13, 2013 by Gil Kalai

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 , , | Leave a comment