Survey
* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project
Download Tight Upper Bound on the Number of Vertices of Polyhedra with $0,1
Document related concepts
Euclidean vector wikipedia , lookup
Determinant wikipedia , lookup
Matrix (mathematics) wikipedia , lookup
Covariance and contravariance of vectors wikipedia , lookup
Orthogonal matrix wikipedia , lookup
Non-negative matrix factorization wikipedia , lookup
Singular-value decomposition wikipedia , lookup
Shapley–Folkman lemma wikipedia , lookup
Four-vector wikipedia , lookup
Cayley–Hamilton theorem wikipedia , lookup
Matrix calculus wikipedia , lookup
Matrix multiplication wikipedia , lookup
Signed graph wikipedia , lookup
Transcript
Tight Upper Bound on the Number of Vertices of Polyhedra with $0,1$Constraint Matrices
abstract
In this talk we give upper bounds for the number of vertices of the
polyhedron $P(A,b)=\{x\in \mathbb{R}^d~:~Ax\leq b\}$ when the
$m\times d$ constraint matrix $A$ is subjected to certain
restriction. For instance, if $A$ is a 0/1-matrix, then there can be
at most $d!$ vertices and this bound is tight, or if the entries of
$A$ are non-negative integers so that each row sums to at most $C$,
then there can be at most $C^d$ vertices. These bounds are
consequences of a more general theorem that the number of vertices
of $P(A,b)$ is at most $d!\cdot W/D$, where $W$ is the volume of the
convex hull of the zero vector and the row vectors of $A$, and $D$
is the smallest absolute value of any non-zero $d\times d$
subdeterminant of $A$.
