Recent Comments

Recent Posts
 Open problem session of HUJICOMBSEM: Problem #1, Nati Linial – Turan type theorems for simplicial complexes.
 Péter Pál Pach and Richárd Palincza: a Glimpse Beyond the Horizon
 To cheer you up 14: Hong Liu and Richard Montgomery solved the Erdős and Hajnal’s odd cycle problem
 To cheer you up in difficult times 13: Triangulating real projective spaces with subexponentially many vertices
 Benjamini and Mossel’s 2000 Account: Sensitivity of Voting Schemes to Mistakes and Manipulations
 Test Your Intuition (46): What is the Reason for Maine’s Huge Influence?
 This question from Tim Gowers will certainly cheeer you up! and test your intuition as well!
 Three games to cheer you up.
 Cheerful Test Your Intuition (#45): Survey About Sisters and Brothers
Top Posts & Pages
 Open problem session of HUJICOMBSEM: Problem #1, Nati Linial  Turan type theorems for simplicial complexes.
 Péter Pál Pach and Richárd Palincza: a Glimpse Beyond the Horizon
 To cheer you up 14: Hong Liu and Richard Montgomery solved the Erdős and Hajnal's odd cycle problem
 TYI 30: Expected number of Dice throws
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 This question from Tim Gowers will certainly cheeer you up! and test your intuition as well!
 Cheerful Test Your Intuition (#45): Survey About Sisters and Brothers
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 To cheer you up in difficult times 13: Triangulating real projective spaces with subexponentially many vertices
RSS
Category Archives: Open problems
Open problem session of HUJICOMBSEM: Problem #1, Nati Linial – Turan type theorems for simplicial complexes.
On November, 2020 we had a very nice open problem session in our weekly combinatorics seminar at HUJI. So I thought to have a series of posts to describe you the problems presented there. This is the first post in … Continue reading
Péter Pál Pach and Richárd Palincza: a Glimpse Beyond the Horizon
Prologue Consider the following problems: P3: What is the maximum density of a set A in without a 3term AP? (AP=arithmetic progression.) This is the celebrated Cap Set problem and we reported here in 2016 the breakthrough results by … Continue reading
Posted in Combinatorics, Geometry, Number theory, Open problems
Tagged Péter Pál Pach, Richárd Palincza
6 Comments
Kelman, Kindler, Lifshitz, Minzer, and Safra: Towards the EntropyInfluence Conjecture
Let me briefly report on a remarkable new paper by Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, and Muli Safra, Revisiting BourgainKalai and Fourier Entropies. The paper describes substantial progress towards the EntropyInfluence conjecture, posed by Ehud Friedgut and … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Open problems
Tagged Dor Minzer, Esty Kelman, Guy Kindler, Muli Safra, Noam Lifshitz
1 Comment
Ringel Conjecture, Solved! Congratulations to Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov
Ringel’s conjecture solved (for sufficiently large n) A couple weeks ago and a few days after I heard an excellent lecture about it by Alexey Pokrovskiy in Oberwolfach, the paper A proof of Ringel’s Conjecture by Richard Montgomery, Alexey Pokrovskiy, … Continue reading
Posted in Combinatorics, Open problems, Updates
Tagged Alexey Pokrovskiy, Benny Sudakov, Richard Montgomery
3 Comments
Test your intuition 43: Distribution According to Areas in Top Departments.
In the community of mamathetitians in a certain country there are mamathetitians in two areas: Anabra (fraction p of the mamathetitians) and Algasis (fraction 1p of mamathetitians.) There are ten universities with 50 faculty members in each mamathetics department … Continue reading
Posted in Combinatorics, Open problems, Probability, Test your intuition
Tagged Test your intuition
9 Comments
Gérard Cornuéjols’s baker’s eighteen 5000 dollars conjectures
Gérard Cornuéjols Gérard Cornuéjols‘s beautiful (and freely available) book from 2000 Optimization: Packing and Covering is about an important area of combinatorics which is lovely described in the preface to the book The integer programming models known as set packing … Continue reading
Richard Ehrenborg’s problem on spanning trees in bipartite graphs
Richard Ehrenborg with a polyhedron In the Problem session last Thursday in Oberwolfach, Steve Klee presented a beautiful problem of Richard Ehrenborg regarding the number of spanning trees in bipartite graphs. Let be a bipartite graph with vertices on one … Continue reading
A sensation in the morning news – Yaroslav Shitov: Counterexamples to Hedetniemi’s conjecture.
Two days ago Nati Linial sent me an email entitled “A sensation in the morning news”. The link was to a new arXived paper by Yaroslav Shitov: Counterexamples to Hedetniemi’s conjecture. Hedetniemi’s 1966 conjecture asserts that if and are two … Continue reading
Posted in Combinatorics, Open problems, Updates
Tagged Hedetniemi's conjecture, Yaroslav Shitov
16 Comments
Cohen, Haeupler, and Schulman: Explicit Binary TreeCodes & Cancellations
The highdimensional conference in Jerusalem is running with many exciting talks (and they are videotaped), and today in Tel Aviv there is a conference on Optimization and Discrete Geometry : Theory and Practice. Today in Jerusalem, Leonard Schulman talked (video available!) … Continue reading
Coloring Problems for Arrangements of Circles (and Pseudocircles)
To supplement and celebrate Aubrey de Grey’s result here are Eight problems on coloring circles A) Consider a finite family of unit circles. What is the minimum number of colors needed to color the circles so that tangent circles are … Continue reading
Posted in Combinatorics, Geometry, Open problems
Tagged Geometric combinatorics, geometric graphs, Graphcoloring
12 Comments