### Recent Comments

domotorp on Polymath10, Post 2: Homologica… GFP on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… Gil Kalai on Polymath10, Post 2: Homologica… Gil Kalai on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… Gil Kalai on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… -
### Recent Posts

- Polymath10, Post 2: Homological Approach
- Polymath10: The Erdos Rado Delta System Conjecture
- Convex Polytopes: Seperation, Expansion, Chordality, and Approximations of Smooth Bodies
- Igor Pak’s collection of combinatorics videos
- EDP Reflections and Celebrations
- Séminaire N. Bourbaki – Designs Exist (after Peter Keevash) – the paper
- Important formulas in Combinatorics
- Updates and plans III.
- NogaFest, NogaFormulas, and Amazing Cash Prizes

### Top Posts & Pages

- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Polymath10, Post 2: Homological Approach
- Polymath10: The Erdos Rado Delta System Conjecture
- Why is Mathematics Possible: Tim Gowers's Take on the Matter
- New Ramanujan Graphs!
- Believing that the Earth is Round When it Matters
- About
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- From Oberwolfach: The Topological Tverberg Conjecture is False

### RSS

# Category Archives: Teaching

## 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

## High Dimensional Expanders: Introduction I

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

Posted in Combinatorics, Teaching
4 Comments

## In how many ways you can chose a committee of three students from a class of ten students?

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

Posted in Mathematics to the rescue, Riddles, Teaching
1 Comment

## Test Your Intuition (11): Is it Rational to Insure a Toaster

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

Posted in Probability, Rationality, Teaching, Test your intuition
Tagged Insurance, Test your intuition
18 Comments

## The Beauty of Mathematics

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

Posted in Teaching
26 Comments