Recent Comments
-
Recent Posts
- The Trifference Problem
- Greatest Hits 2015-2022, Part II
- Greatest Hits 2015-2022, Part I
- Tel Aviv University Theory Fest is Starting Tomorrow
- Alef’s Corner
- A Nice Example Related to the Frankl Conjecture
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- Barnabás Janzer: Rotation inside convex Kakeya sets
- Inaugural address at the Hungarian Academy of Science: The Quantum Computer – A Miracle or Mirage
Top Posts & Pages
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- A Nice Example Related to the Frankl Conjecture
- The Trifference Problem
- Aubrey de Grey: The chromatic number of the plane is at least 5
- Sarkaria's Proof of Tverberg's Theorem 1
- Amazing: Karim Adiprasito proved the g-conjecture for spheres!
RSS
Tag Archives: Oberwolfach
Test your intuition 47: AGC-GTC-TGC-GTC-TGC-GAC-GATC-? what comes next in the sequence?
Before getting to the main topic of this post, first, Happy New Year 2022 and Merry Christmas to all readers, and second, a quick update: A community blog to discuss open problems in algebraic combinatorics was created. Everybody is invited … Continue reading
Posted in Algebra, Combinatorics, Geometry, Test your intuition
Tagged Oberwolfach, Test your intuition
1 Comment
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
Mohammad Ghomi and Joel Spruck settled the Cartan-Hadamard conjecture!
Greetings from Oberwolfach from a great conference on algebraic, geometric, and topological combinatorics. Stay tuned for more pictures and updates from Oberwolfach and CERN, and also in case you did not see it already here is the link to the … Continue reading
Posted in Geometry
Tagged Cartan-Hadamard's conjecture, Joel Spruck, Mohammad Ghomi, Oberwolfach
5 Comments
From Oberwolfach: The Topological Tverberg Conjecture is False
The topological Tverberg conjecture (discussed in this post), a holy grail of topological combinatorics, was refuted! The three-page paper “Counterexamples to the topological Tverberg conjecture” by Florian Frick gives a brilliant proof that the conjecture is false. The proof is … Continue reading
Posted in Combinatorics, Conferences, Convexity, Updates
Tagged Florian Frick, Issac Mabillard, Oberwolfach, Uli Wagner
3 Comments
My Mathematical Dialogue with Jürgen Eckhoff
Jürgen Eckhoff, Ascona 1999 Jürgen Eckhoff is a German mathematician working in the areas of convexity and combinatorics. Our mathematical paths have met a remarkable number of times. We also met quite a few times in person since our first … Continue reading
Posted in Combinatorics, Convex polytopes, Open problems
Tagged Andy Frohmader, Helly's theorem, Jurgen Eckhoff, Nina Amenta, Noga Alon, Oberwolfach, Roy Meshulam
1 Comment
Amazing: Peter Keevash Constructed General Steiner Systems and Designs
Here is one of the central and oldest problems in combinatorics: Problem: Can you find a collection S of q-subsets from an n-element set X set so that every r-subset of X is included in precisely λ sets in the collection? … Continue reading
Posted in Combinatorics, Open problems
Tagged Combinatorics, Designs, Oberwolfach, Peter Keevash
16 Comments