- Call for nominations for the Ostrowski Prize 2017
- Problems for Imre Bárány’s Birthday!
- Twelves short videos about members of the Department of Mathematics and Statistics at the University of Victoria
- Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science
- Updates (belated) Between New Haven, Jerusalem, and Tel-Aviv
- Oded Goldreich Fest
- The Race to Quantum Technologies and Quantum Computers (Useful Links)
- Around the Garsia-Stanley’s Partitioning Conjecture
- My Answer to TYI- 28
Top Posts & Pages
- Academic Degrees and Sex
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Updates and plans III.
- 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
- Believing that the Earth is Round When it Matters
- AlexFest: 60 Faces of Groups
- Why Quantum Computers Cannot Work: The Movie!
- Emmanuel Abbe: Erdal Arıkan's Polar Codes
Tag Archives: Test your intuition
We are considering the stable marriage theorem. Suppose that there are n men and n women. If the preferences are random and men are proposing, what is the likely average women’s rank of their husbands, and what is the likely average … Continue reading
Stable mariage The Gale-Shapley stable matching theorem and the algorithm. GALE-SHAPLEY THEOREM Consider a society of n men and n women and suppose that every man [and every woman] have a preference (linear) relation on the women [men] he [she] knows. Then … Continue reading
(A few more quantum posts are coming. But let’s have a quick break for games.) Tic Tac Toe is played since anciant times. For the common version, where the two players X and O take turns in marking the empty squares … Continue reading
The Question Suppose that you want to send a message so that it will reach all vertices of the discrete -dimensional cube. At each time unit (or round) you can send the message to one vertex. When a vertex gets the … Continue reading
Recall that the -dimensional discrete cube is the set of all binary vectors ( vectors) of length n. We say that two binary vectors are adjacent if they differ in precisely one coordinate. (In other words, their Hamming distance is 1.) This … 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
Test your intuition: For two n by n matrices A and B, is it always the case that tr(ABAB) = tr(ABBA)?
Let P be a d-dimensional convex polytope. Can we always perturb the vertices of P moving them to points with rational coordinates without changing the combinatorial structure of P? In order words, you require that a set of vertices whose … Continue reading
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
This is a bit unusual post in the “test your intuition” corner as the problem is not entirely formal. How does random noise in the digital world typically look? Suppose you have a memory of n bits, or a memory based on a larger … Continue reading