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 to the diameter of graphs of simple d-polytopes.
All the methods I am aware of for providing upper bounds are fairly simple.
(1) You think about a strategy from moving from one set to another,
(2) You use this strategy to get a recursive bound,
(3) You solve the recursion and hope for the best.
What I would like you to think about, along with reading these posts, is the following questions:
(a) Can I come up with a different/better strategy for moving from one set to the other?
(b) Can I think about a mathematically more sophisticated way to get an upper bound for the diameter?
(c) Can this process of finding a strategy/writing the associated recurrence/solving the recurrence be automatized? The type of proofs we will describe are very simple and this looks like a nice example for a “quasi-automatic” proof process.
Let me repeat the problem and prove to you a nice upper bound:
Reminder: 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
.
For a subset let
denote the subfamily of all subsets of
which contain
.
MAIN ASSUMPTION: Suppose that for every for which
is not empty
is connected.
MAIN QUESTION: How large can the diameter of be in terms of
and
.
Let us denote the answer by .
4. A one line observation.
What the upper bound tells us about the diameter of
? Let
be the family obtained from
by removing the elements of A from every set. Note that
. Therefore, the diameter of
is at most
, where
and
is the number of elements in the union of all the sets in
.
5. Linear bounds for a fixed dimension
Let’s use the following strategy to move from one set to the other.
Given two sets S and T in we first try to move from S to T using a different type of path.
, where this time
. We will choose such a path with t being as small as possible.
Let . We will consider the families
.
The one line observation tells us that the diameter of is bounded from above by
where
the number of elements in the union
of all the sets in
.
We want to prove an upper bound on of the form
. For this purpose, let us have a closer look at these
sets
.
Claim: if
.
Proof: Suppose that and
. So there is a set
which contains
and
, and there is a set
which contains both
and
. Now we can shortcut! We replace the segment
by
. This will give us a shorter path of the peculiar type we consider here.
The claim implies that every element of N is included in at most three s. We are done! If
then we get that the distance between
and
in
is at most
. This gives us
.
This argument is due to Barnette.
Reminder: The connection with Hirsch’s Conjecture
The Hirsch Conjecture asserts that the diameter of the graph G(P) of a d-polytope P with n facets is at most n-d. Not even a polynomial upper bound for the diameter in terms of d and n is known. Finding good upper bounds for the diameter of graphs of d-polytopes is one of the central open problems in the study of convex polytopes. If d is fixed then a linear bound in n is known, and the best bound in terms of d and n is . We will come back to these results later.
One basic fact to remember is that for every d-polytope P, G(P) is a connected graph. As a matter of fact, a theorem of Balinski asserts that G(P)$ is d-connected.
The combinatorial diameter problem I mentioned in an earlier post (and which is repeated below) is closely related. Let me now explain the connection.
Let P be a simple d-polytope. Suppose that P is determined by n inequalities, and that each inequality describes a facet of P. Now we can define a family of subsets of {1,2,…,n} as follows. Let
be the n inequalities defining the polytopeP, and let
be the n corresponding facets. Every vertex v of P belongs to precisely d facets (this is equivalent to P being a simple polytope). Let
be the indices of the facets containing v, or, equivalently, the indices of the inequalities which are satisfied as equalities at v. Now, let
be the family of all sets
for all vertices of the polytope P.
The following observations are easy.
(1) Two vertices v and w of P are adjacent in the graph of P if and only if . Therefore,
.
(2) If A is a set of indices. The vertices v of P such that are precisely the set of vertices of a lower dimensional face of P. This face is described by all the vertices of P which satisfies all the inequalities indexed by
, or equivalently all vertices in P which belong to the intersection of the facets
for
.
Therefore, for every if
is not empty the graph
is connected – this graph is just the graph of some lower dimensional polytope. This was the main assumption in our abstract problem.
Remark: It is known that the assertion of the Hirsch Conjecture fails for the abstract setting. There are examples of families where the diameter is as large as n-(4/5)d.
Pingback: A Diameter problem (7): The Best Known Bound « Combinatorics and more