- 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
- Proof By Lice!
- The seventeen camels riddle, and Noga Alon's camel proof and algorithms
- Updates and plans III.
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Extremal Combinatorics III: Some Basic Theorems
- Can Category Theory Serve as the Foundation of Mathematics?
- When It Rains It Pours
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
Category Archives: Games
The following paradox was raised by Rann Smorodinsky: Rann Smorodinsky’s Privacy Paradox Suppose that you have the following one-time scenario. You want to buy a sandwich where the options are a roast beef sandwich or an avocado sandwich. Choosing … Continue reading
The following post was kindly contributed by Eyal Sulganik from IDC (Interdiciplinary Center) Herzliya. Eyal was motivated by our poll on certainty “beyond a reasonable doubt,” which is related to several issues in accounting. Mathematicians, I believe, are always looking … Continue reading
Dinitz’ conjecture The following theorem was conjectured by Jeff Dinitz in 1979 and proved by Fred Galvin in 1994: Theorem: Consider an n by n square table such that in each cell (i,j) you have a set with n or more elements. … Continue reading
The angle of Victoria Beckham’s hat (here in a picture from a recent wedding) is closely related to our previous post on football One of the highlights of the recent Newton Institute conference on discrete harmonic analysis was a football … Continue reading
The Complexity of Zero-Sum Stochastic Games with Perfect Information Is there a polynomial time algorithm for chess? Well, if we consider the complexity of chess in terms of the board size then it is fair to think that the answer is … Continue reading
Oliver Friedmann, Thomas Dueholm Hansen, and Uri Zwick have managed to prove subexponential lower bounds of the form for the following two basic randomized pivot rules for the simplex algorithm! This is the first result of its kind and deciding … Continue reading
Recall the game “matching pennies“. Player I has to chose between ‘0’ or ‘1’, player II has to chose between ‘0’ and ‘1’.No player knows what is the choice of the other player before making his choice. Player II pays … Continue reading
A recent interesting article by Ariel Rubinstein entitled “Digital Sodom” (in Hebrew) argues that certain forms of futures trading (and Internet sites where these forms of trading take place) are essentially gambling activities. The issue of “what is gambling” is very intereting. In an earlier … Continue reading