most recent 30 from http://mathoverflow.net 2013-06-19T02:01:27Z http://mathoverflow.net/feeds/question/70255 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/70255/a-question-about-a-blue-fan-and-a-red-fan-and-their-common-refinement Gil Kalai 2011-07-13T19:54:47Z 2011-07-14T11:27:36Z

<p>Is the following conjecture true?</p> <p><strong>Conjecture:</strong> Let $M_1$ be a red map and let $M_2$ be a blue map drawn in general position on $S^n$, and let $M$ be their common refinement. There is a vertex $w$ of $M$, a blue vertex $v$ of $M_1$, a red vertex $u$ of $M_2$ and two faces $F,G$ of $M$ such that 1) $v,w \in F$ , 2) $u,w \in G$, and 3) $\dim F +\dim G =n$.</p> <p>A simple (but perhaps not the most general) setting in which to ask this question is with regard to the red and blue maps coming from red and blue polyhedral fans associated to red and blue convex polytopes. The common refinement will be the fan obtained by taking all intersections of cones, one from the first fan and one from the second.</p> <h2>Motivation</h2> <p>For $n=2$ was proved by Paco Santos,Tamon Stephen and Hugh Thomas. They gave two proofs. One is based on an Euler characteristic argument, and the other applies a connectivity argument. <a href="http://front.math.ucdavis.edu/1104.2630" rel="nofollow">Here is a link to the paper.</a> </p> <p>A positive answer to the conjecture in all dimensions will imply an upper bound of the form $nd$ to diameters of graphs of simple $d$-dimensional polytopes with $n$ facets. (Proving the conjecture for the simple case mentioned above would suffice.) This will be great as no polynomial upper bound is known. For more information see <a href="http://gilkalai.wordpress.com/2011/04/13/polymath3-phc6-the-polynomial-hirsch-conjecture-a-topological-approach/#comments" rel="nofollow">this post</a>.</p>