Category Archives: Polymath3

Last hours of 2024: One Wish, Reviving(?) Polymath3, Peter Sarnak’s Question, and Quantum Plans

Posted on December 31, 2024 by Gil Kalai

A wish It is time for the horrible war to end Polymath thoughts: Reviving Polymath3? A question for our readers: Should we revive polymath3? Polymath3 dealt with the following problem: Is there a polynomial  such that the graph of every … Continue reading →

Posted in Polymath3, Updates | 8 Comments

A High-Dimensional Diameter Problem for Polytopes

Posted on July 12, 2023 by Gil Kalai

Avi Wigderson is here for a year and it was a good opportunity to go back together to the question of diameter of polytopes. The diameter problem for polytopes is to determine the behavior of the maximum diameter of the … Continue reading →

Posted in Combinatorics, Convex polytopes, Convexity, Polymath3 | Tagged , , , | 5 Comments

News (mainly polymath related)

Posted on January 20, 2016 by Gil Kalai

Update (Jan 21) j) Polymath11 (?) Tim Gowers’s proposed a polymath project on Frankl’s conjecture. If it will get off the ground we will have (with polymath10) two projects running in parallel which is very nice. (In the comments Jon Awbrey gave … Continue reading →

Posted in Combinatorics, Conferences, Mathematics over the Internet, Polymath10, Polymath3, Updates | Tagged , , , , , , , , | 11 Comments

Polymath3 (PHC6): The Polynomial Hirsch Conjecture – A Topological Approach

Posted on April 13, 2011 by Gil Kalai

This is a new polymath3 research thread. Our aim is to tackle the polynomial Hirsch conjecture which asserts that there is a polynomial upper bound for the diameter of graphs of -dimensional polytopes with facets. Our research so far was … Continue reading →

Posted in Convex polytopes, Geometry, Polymath3 | Tagged , , | 37 Comments

Polynomial Hirsch Conjecture 5: Abstractions and Counterexamples.

Posted on November 28, 2010 by Gil Kalai

This is the 5th research thread of polymath3 studying the polynomial Hirsch conjecture. As you may remember, we are mainly interested in an abstract form of the problem about families of sets. (And a related version about families of multisets.) The … Continue reading →

Posted in Open problems, Polymath3 | Tagged , | 60 Comments

Polymath3: Polynomial Hirsch Conjecture 4

Posted on October 21, 2010 by Gil Kalai

So where are we? I guess we are trying all sorts of things, and perhaps we should try even more things. I find it very difficult to choose the more promising ideas, directions and comments as Tim Gowers and Terry Tao did so … Continue reading →

Posted in Combinatorics, Convex polytopes, Open problems, Polymath3 | Tagged , | 74 Comments

Polymath3 : Polynomial Hirsch Conjecture 3

Posted on October 10, 2010 by Gil Kalai

Here is the third research thread for the polynomial Hirsch conjecture.  I hope that people will feel as comfortable as possible to offer ideas about the problem we discuss. Even more important, to think about the problem either in the directions suggested by … Continue reading →

Posted in Combinatorics, Convex polytopes, Open problems, Polymath3 | Tagged | 102 Comments

Polymath 3: The Polynomial Hirsch Conjecture 2

Posted on October 3, 2010 by Gil Kalai

Here we start the second research thread about the polynomial Hirsch conjecture.  I hope that people will feel as comfortable as possible to offer ideas about the problem. The combinatorial problem looks simple and also everything that we know about it is rather simple: … Continue reading →

Posted in Convex polytopes, Open problems, Polymath3 | Tagged , | 104 Comments

Polymath 3: Polynomial Hirsch Conjecture

Posted on September 29, 2010 by Gil Kalai

I would like to start here a research thread of the long-promised Polymath3 on the polynomial Hirsch conjecture. I propose to try to solve the following purely combinatorial problem. Consider t disjoint families of subsets of {1,2,…,n}, . Suppose that … Continue reading →

Posted in Convex polytopes, Open problems, Polymath3 | Tagged , | 120 Comments

The Polynomial Hirsch Conjecture: The Crux of the Matter.

Posted on June 19, 2010 by Gil Kalai

 Consider t disjoint families of subsets of {1,2,…,n}, .   Suppose that (*) For every , and every and , there is  which contains .  The basic question is: How large can t  be???   Let’s call the answer f(n).   … Continue reading →

Posted in Combinatorics, Convex polytopes, Open problems, Polymath3 | 6 Comments