22 research outputs found
A new upper bound on the number of neighborly boxes in R^d
A new upper bound on the number of neighborly boxes in R^d is given. We apply
a classical result of Kleitman on the maximum size of sets with a given
diameter in discrete hypercubes. We also present results of some computational
experiments and an emerging conjecture
Exact values and improved bounds on -neighborly families of boxes
A finite family of -dimensional convex polytopes is called
-neighborly if for any two distinct
members . In 1997, Alon initiated the study of the general
function , which is defined to be the maximum size of -neighborly
families of standard boxes in . Based on a weighted count of
vectors in , we improve a recent upper bound on by Alon,
Grytczuk, Kisielewicz, and Przes\l awski for any positive integers and
with . In particular, when is sufficiently large and , our upper bound on improves the bound
shown by Huang and Sudakov exponentially.
Furthermore, we determine that , , ,
, , and . The stability result of Kleitman's
isodiametric inequality plays an important role in the proofs.Comment: 17 pages. The main results were further improve
Clique versus Independent Set
Yannakakis' Clique versus Independent Set problem (CL-IS) in communication
complexity asks for the minimum number of cuts separating cliques from stable
sets in a graph, called CS-separator. Yannakakis provides a quasi-polynomial
CS-separator, i.e. of size , and addresses the problem of
finding a polynomial CS-separator. This question is still open even for perfect
graphs. We show that a polynomial CS-separator almost surely exists for random
graphs. Besides, if H is a split graph (i.e. has a vertex-partition into a
clique and a stable set) then there exists a constant for which we find a
CS-separator on the class of H-free graphs. This generalizes a
result of Yannakakis on comparability graphs. We also provide a
CS-separator on the class of graphs without induced path of length k and its
complement. Observe that on one side, is of order
resulting from Vapnik-Chervonenkis dimension, and on the other side, is
exponential.
One of the main reason why Yannakakis' CL-IS problem is fascinating is that
it admits equivalent formulations. Our main result in this respect is to show
that a polynomial CS-separator is equivalent to the polynomial
Alon-Saks-Seymour Conjecture, asserting that if a graph has an edge-partition
into k complete bipartite graphs, then its chromatic number is polynomially
bounded in terms of k. We also show that the classical approach to the stubborn
problem (arising in CSP) which consists in covering the set of all solutions by
instances of 2-SAT is again equivalent to the existence of a
polynomial CS-separator
On the number of neighborly simplices in R^d
Two -dimensional simplices in are neighborly if its intersection is
a -dimensional set. A family of -dimensional simplices in is
called neighborly if every two simplices of the family are neighborly. Let
be the maximal cardinality of a neighborly family of -dimensional
simplices in . Based on the structure of some codes
it is shown that . Moreover, a
result on the structure of codes is given