Related papers: Primary Facets Of Order Polytopes
A mode of a probability vector is a local maximum with respect to some vicinity structure on the set of elementary events. The mode inequalities cut out a polytope from the simplex of probability vectors. Related to this is the concept of…
The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…
We propose a theoretical framework under which preference profiles can be meaningfully compared. Specifically, given a finite set of feasible allocations and a preference profile, we first define a ranking vector of an allocation as the…
We introduce a novel definition of orientation on the triples of a family of pairwise intersecting planar convex sets and study its properties. In particular, we compare it to other systems of orientations on triples that satisfy a…
In this paper, we study the simplex faces of the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a finite poset $P$. We show that, if $P$ can be recursively constructed from $\mathbf{X}$-free posets using disjoint…
A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…
The main result of this paper is that the polytope of the bipartite TSP is significantly different from that of the general TSP. Comb inequalities are known as facet defining ones in the general case. In the bipartite case, however, many of…
We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…
Order and symmetry are main structural principles in mathematics. We give five examples where on the face of it order is not apparent, but deeper investigations reveal that they are governed by order structures. These examples are finite…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
In the geometry of polynomials, Schoenberg's conjecture, now a theorem, is a quadratic inequality between the zeros and critical points of a polynomial whose zeros have their centroid at the origin. We call its generalizations to other…
This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…
The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that is equivalent to optimizing a linear objective function over the QAP polytope. The QAP polytope with parameter $n$ - \qappolytope{n} - is defined as the convex hull…
We study polytopes associated to factorisations of prime powers. These polytopes have explicit descriptions either in terms of their vertices or as intersections of closed halfspaces associated to their facets. We give formulae for their…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…
For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…
Ordinary polytopes are known as a non-simplicial generalization of the cyclic polytopes. The face vectors of ordinary polytopes are shown to be log-concave.
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…