573 research outputs found
Polytopality and Cartesian products of graphs
We study the question of polytopality of graphs: when is a given graph the
graph of a polytope? We first review the known necessary conditions for a graph
to be polytopal, and we provide several families of graphs which satisfy all
these conditions, but which nonetheless are not graphs of polytopes. Our main
contribution concerns the polytopality of Cartesian products of non-polytopal
graphs. On the one hand, we show that products of simple polytopes are the only
simple polytopes whose graph is a product. On the other hand, we provide a
general method to construct (non-simple) polytopal products whose factors are
not polytopal.Comment: 21 pages, 10 figure
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-genus Graphs
We give an -size extended formulation
for the spanning tree polytope of an -vertex graph embedded on a surface of
genus , improving on the known -size extended formulations
following from Wong and Martin.Comment: v3: fixed some typo
On the extension complexity of combinatorial polytopes
In this paper we extend recent results of Fiorini et al. on the extension
complexity of the cut polytope and related polyhedra. We first describe a
lifting argument to show exponential extension complexity for a number of
NP-complete problems including subset-sum and three dimensional matching. We
then obtain a relationship between the extension complexity of the cut polytope
of a graph and that of its graph minors. Using this we are able to show
exponential extension complexity for the cut polytope of a large number of
graphs, including those used in quantum information and suspensions of cubic
planar graphs.Comment: 15 pages, 3 figures, 2 table
Scattering Forms and the Positive Geometry of Kinematics, Color and the Worldsheet
The search for a theory of the S-Matrix has revealed surprising geometric
structures underlying amplitudes ranging from the worldsheet to the
amplituhedron, but these are all geometries in auxiliary spaces as opposed to
kinematic space where amplitudes live. In this paper, we propose a novel
geometric understanding of amplitudes for a large class of theories. The key is
to think of amplitudes as differential forms directly on kinematic space. We
explore this picture for a wide range of massless theories in general spacetime
dimensions. For the bi-adjoint cubic scalar, we establish a direct connection
between its "scattering form" and a classic polytope--the associahedron--known
to mathematicians since the 1960's. We find an associahedron living naturally
in kinematic space, and the tree amplitude is simply the "canonical form"
associated with this "positive geometry". Basic physical properties such as
locality, unitarity and novel "soft" limits are fully determined by the
geometry. Furthermore, the moduli space for the open string worldsheet has also
long been recognized as an associahedron. We show that the scattering equations
act as a diffeomorphism between this old "worldsheet associahedron" and the new
"kinematic associahedron", providing a geometric interpretation and novel
derivation of the bi-adjoint CHY formula. We also find "scattering forms" on
kinematic space for Yang-Mills and the Non-linear Sigma Model, which are dual
to the color-dressed amplitudes despite having no explicit color factors. This
is possible due to a remarkable fact--"Color is Kinematics"--whereby kinematic
wedge products in the scattering forms satisfy the same Jacobi relations as
color factors. Finally, our scattering forms are well-defined on the
projectivized kinematic space, a property that provides a geometric origin for
color-kinematics duality.Comment: 77 pages, 25 figures; v2, corrected discussion of worldsheet
associahedron canonical for
Pseudograph associahedra
Given a simple graph G, the graph associahedron KG is a simple polytope whose
face poset is based on the connected subgraphs of G. This paper defines and
constructs graph associahedra in a general context, for pseudographs with loops
and multiple edges, which are also allowed to be disconnected. We then consider
deformations of pseudograph associahedra as their underlying graphs are altered
by edge contractions and edge deletions.Comment: 25 pages, 22 figure
Expansive Motions and the Polytope of Pointed Pseudo-Triangulations
We introduce the polytope of pointed pseudo-triangulations of a point set in
the plane, defined as the polytope of infinitesimal expansive motions of the
points subject to certain constraints on the increase of their distances. Its
1-skeleton is the graph whose vertices are the pointed pseudo-triangulations of
the point set and whose edges are flips of interior pseudo-triangulation edges.
For points in convex position we obtain a new realization of the
associahedron, i.e., a geometric representation of the set of triangulations of
an n-gon, or of the set of binary trees on n vertices, or of many other
combinatorial objects that are counted by the Catalan numbers. By considering
the 1-dimensional version of the polytope of constrained expansive motions we
obtain a second distinct realization of the associahedron as a perturbation of
the positive cell in a Coxeter arrangement.
Our methods produce as a by-product a new proof that every simple polygon or
polygonal arc in the plane has expansive motions, a key step in the proofs of
the Carpenter's Rule Theorem by Connelly, Demaine and Rote (2000) and by
Streinu (2000).Comment: 40 pages, 7 figures. Changes from v1: added some comments (specially
to the "Further remarks" in Section 5) + changed to final book format. This
version is to appear in "Discrete and Computational Geometry -- The
Goodman-Pollack Festschrift" (B. Aronov, S. Basu, J. Pach, M. Sharir, eds),
series "Algorithms and Combinatorics", Springer Verlag, Berli
The polytope of non-crossing graphs on a planar point set
For any finite set \A of points in , we define a
-dimensional simple polyhedron whose face poset is isomorphic to the
poset of ``non-crossing marked graphs'' with vertex set \A, where a marked
graph is defined as a geometric graph together with a subset of its vertices.
The poset of non-crossing graphs on \A appears as the complement of the star
of a face in that polyhedron.
The polyhedron has a unique maximal bounded face, of dimension
where is the number of points of \A in the interior of \conv(\A). The
vertices of this polytope are all the pseudo-triangulations of \A, and the
edges are flips of two types: the traditional diagonal flips (in
pseudo-triangulations) and the removal or insertion of a single edge.
As a by-product of our construction we prove that all pseudo-triangulations
are infinitesimally rigid graphs.Comment: 28 pages, 16 figures. Main change from v1 and v2: Introduction has
been reshape
- …