More bounds on the diameters of convex polytopes

Details More bounds on the diameters of convex polytopes More bounds on the diameters of convex polytopes

2009-11-25

arxiv.org/abs/0911.4982v1

Mathematics

Combinatorics

Scientific paper

Finding a good bound on the maximal edge diameter $\Delta(d,n)$ of a polytope in terms of its dimension $d$ and the number of its facets $n$ is one of the basic open questions in polytope theory \cite{BG}. Although some bounds are known, the behaviour of the function $\Delta(d,n)$ is largely unknown. The Hirsch conjecture, formulated in 1957 and reported in \cite{GD}, states that $\Delta(d,n)$ is linear in $n$ and $d$: $\Delta(d,n) \leq n-d$. The conjecture is known to hold in small dimensions, i.e., for $d \leq 3$ \cite{VK}, along with other specific pairs of $d$ and $n$ (Table \ref{before}). However, the asymptotic behaviour of $\Delta(d,n)$ is not well understood: the best upper bound -- due to Kalai and Kleitman -- is quasi-polynomial \cite{GKDK}. In this article we will show that $\Delta(4,12)=7$ and present strong evidence for $\Delta(5,12)=\Delta(6,13)=7$. The first of these new values is of particular interest since it indicates that the Hirsch bound is not sharp in dimension 4.

Affiliated with

Also associated with

No associations

Rating

More bounds on the diameters of convex polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with More bounds on the diameters of convex polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and More bounds on the diameters of convex polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-116116