### Recent Comments

Gil Kalai on זה הזמן לשינוי Yiftach on זה הזמן לשינוי Gil Kalai on זה הזמן לשינוי Yiftach on זה הזמן לשינוי Gil Kalai on זה הזמן לשינוי קוסמופוליט on זה הזמן לשינוי Gil Kalai on זה הזמן לשינוי Eli_B on זה הזמן לשינוי Michael Elkin on זה הזמן לשינוי Gil Kalai on זה הזמן לשינוי Eli_B on זה הזמן לשינוי Gil Kalai on זה הזמן לשינוי -
### Recent Posts

- בחירות 2015 – בוא נבחר באביב
- זה הזמן לשינוי
- Combinatorics and More – Greatest Hits
- Ilan and me
- The Simplex, the Cyclic polytope, the Positroidron, the Amplituhedron, and Beyond
- From Oberwolfach: The Topological Tverberg Conjecture is False
- Midrasha Mathematicae #18: In And Around Combinatorics
- Quantum computing: achievable reality or unrealistic dream
- A Historical Picture Taken by Nimrod Megiddo

### Top Posts & Pages

- בחירות 2015 - בוא נבחר באביב
- זה הזמן לשינוי
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- The Simplex, the Cyclic polytope, the Positroidron, the Amplituhedron, and Beyond
- Believing that the Earth is Round When it Matters
- A Historical Picture Taken by Nimrod Megiddo
- Five Open Problems Regarding Convex Polytopes
- Extremal Combinatorics III: Some Basic Theorems
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun

### RSS

# Tag Archives: Hirsch conjecture

## The Polynomial Hirsch Conjecture – How to Improve the Upper Bounds.

I can see three main avenues toward making progress on the Polynomial Hirsch conjecture. One direction is trying to improve the upper bounds, for example, by looking at the current proof and trying to see if it is wasteful and if so where … Continue reading

Posted in Convex polytopes, Open discussion, Open problems
Tagged Discussion, Hirsch conjecture
14 Comments

## The Polynomial Hirsch Conjecture, a Proposal for Polymath3 (Cont.)

The Abstract Polynomial Hirsch Conjecture A convex polytope is the convex hull of a finite set of points in a real vector space. A polytope can be described as the intersection of a finite number of closed halfspaces. Polytopes have … Continue reading

Posted in Convex polytopes, Open discussion, Open problems
Tagged Hirsch conjecture, Polymath proposals
5 Comments

## The Polynomial Hirsch Conjecture: A proposal for Polymath3

This post is continued here. Eddie Kim and Francisco Santos have just uploaded a survey article on the Hirsch Conjecture. The Hirsch conjecture: The graph of a d-polytope with n vertices facets has diameter at most n-d. We devoted several … Continue reading

## A Diameter problem (7): The Best Known Bound

Our Diameter problem for families of sets Consider a family of subsets of size d of the set N={1,2,…,n}. Associate to a graph as follows: The vertices of are simply the sets in . Two vertices and are adjacent if . … Continue reading

## A Diameter Problem (6): Abstract Objective Functions

George Dantzig and Leonid Khachyan In this part we will not progress on the diameter problem that we discussed in the earlier posts but will rather describe a closely related problem for directed graphs associated with ordered families of sets. The role models for … Continue reading

Posted in Combinatorics, Convex polytopes, Open problems
Tagged Hirsch conjecture, Linear programming
7 Comments

## A Diameter Problem (5)

6. First subexponential bounds. Proposition 1: How to prove it: This is easy to prove: Given two sets and in our family , we first find a path of the form where, and . We let with and consider the family … Continue reading

## Diameter Problem (4)

Let us consider another strategy to deal with our diameter problem. Let us try to associate other graphs to our family of sets. Recall that we consider a family of subsets of size of the set . Let us now associate … Continue reading

## Diameter Problem (3)

3. What we will do in this post and and in future posts We will now try all sorts of ideas to give good upper bounds for the abstract diameter problem that we described. As we explained, such bounds apply … Continue reading

Posted in Combinatorics, Convex polytopes, Open problems
Tagged Hirsch conjecture, Linear programming, Quasi-automated proofs
1 Comment