Results 1  10
of
40
Linear Programming, the Simplex Algorithm and Simple Polytopes
 Math. Programming
, 1997
"... In the first part of the paper we survey some farreaching applications of the basic facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concerning the simplex algorithm. We describe subexponential randomized pivot ru ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
In the first part of the paper we survey some farreaching applications of the basic facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concerning the simplex algorithm. We describe subexponential randomized pivot rules and upper bounds on the diameter of graphs of polytopes. 1 Introduction: A convex polyhedron is the intersection P of a finite number of closed halfspaces in R d . P is a ddimensional polyhedron (briefly, a dpolyhedron) if the points in P affinely span R d . A convex ddimensional polytope (briefly, a dpolytope) is a bounded convex dpolyhedron. Alternatively, a convex dpolytope is the convex hull of a finite set of points which affinely span R d . A (nontrivial) face F of a dpolyhedron P is the intersection of P with a supporting hyperplane. F itself is a polyhedron of some lower dimension. If the dimension of F is k we call F a kface of P . The empty set and P itself are...
Lattice congruences, fans and Hopf algebras
 J. Combin. Theory Ser. A
"... Abstract. We give a unified explanation of the geometric and algebraic properties of two wellknown maps, one from permutations to triangulations, and another from permutations to subsets. Furthermore we give a broad generalization of the maps. Specifically, for any lattice congruence of the weak or ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
(Show Context)
Abstract. We give a unified explanation of the geometric and algebraic properties of two wellknown maps, one from permutations to triangulations, and another from permutations to subsets. Furthermore we give a broad generalization of the maps. Specifically, for any lattice congruence of the weak order on a Coxeter group we construct a complete fan of convex cones with strong properties relative to the corresponding lattice quotient of the weak order. We show that if a family of lattice congruences on the symmetric groups satisfies certain compatibility conditions then the family defines a sub Hopf algebra of the MalvenutoReutenauer Hopf algebra of permutations. Such a sub Hopf algebra has a basis which is described by a type of patternavoidance. Applying these results, we build the MalvenutoReutenauer algebra as the limit of an infinite sequence of smaller algebras, where the second algebra in the sequence is the Hopf algebra of noncommutative symmetric functions. We also associate both a fan and a Hopf algebra to a set of permutations which appears to be equinumerous with the Baxter permutations. 1.
Realizations of the associahedron and cyclohedron
, 2005
"... We describe many different realizations with integer coordinates for the associahedron (i.e. the Stasheff polytope) and for the cyclohedron (i.e. the BottTaubes polytope) and compare them to the permutahedron of type A and B respectively. The coordinates are obtained by an algorithm which uses an o ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
We describe many different realizations with integer coordinates for the associahedron (i.e. the Stasheff polytope) and for the cyclohedron (i.e. the BottTaubes polytope) and compare them to the permutahedron of type A and B respectively. The coordinates are obtained by an algorithm which uses an oriented Coxeter graph of type An or Bn respectively as only input and which specialises to a procedure presented by J.L. Loday for a certain orientation of An.
Convex hull realizations of the multiplihedra
, 2007
"... Abstract. We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the n th polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be realized as convex polytopes. Contents ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Abstract. We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the n th polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be realized as convex polytopes. Contents
Some Algorithmic Problems in Polytope Theory
 IN ALGEBRA, GEOMETRY, AND SOFTWARE SYSTEMS
, 2003
"... Convex polytopes, i.e.. the intersections of finitely many closed affine halfspaces in R^d, are important objects in various areas of mathematics and other disciplines. In particular, the compact... ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
(Show Context)
Convex polytopes, i.e.. the intersections of finitely many closed affine halfspaces in R^d, are important objects in various areas of mathematics and other disciplines. In particular, the compact...
On the Complexity of Polytope Isomorphism Problems
 Graphs and Combinatorics
, 2003
"... We show that the problem to decide whether two (convex) polytopes, given by their vertexfacet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time algorithm for the combinatorial polytope isom ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
We show that the problem to decide whether two (convex) polytopes, given by their vertexfacet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time algorithm for the combinatorial polytope isomorphism problem in bounded dimensions. Furthermore, we derive that the problems to decide whether two polytopes, given either by vertex or by facet descriptions, are projectively or affinely isomorphic are graph isomorphism hard.
On the kSystems of a Simple Polytope
 ISRAEL J. MATH
, 2001
"... A ksystem of the graph GP of a simple polytope P is a set of induced subgraphs of GP that shares certain properties with the set of subgraphs induced by the kfaces of P . This new concept leads to polynomialsize certicates in terms of GP for both the set of vertex sets of facets as well as fo ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
A ksystem of the graph GP of a simple polytope P is a set of induced subgraphs of GP that shares certain properties with the set of subgraphs induced by the kfaces of P . This new concept leads to polynomialsize certicates in terms of GP for both the set of vertex sets of facets as well as for abstract objective functions (AOF) in the sense of Kalai. Moreover, it is proved that an acyclic orientation yields an AOF if and only if it induces a unique sink on every 2face.
Unique sink orientations of grids
 Proc. 11th Conference on Integer Programming and Combinatorial Optimization (IPCO
, 2005
"... We introduce unique sink orientations of grids as digraph models for many wellstudied problems, including linear programming over products of simplices, generalized linear complementarity problems over Pmatrices (PGLCP), and simple stochastic games. We investigate the combinatorial structure of su ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
(Show Context)
We introduce unique sink orientations of grids as digraph models for many wellstudied problems, including linear programming over products of simplices, generalized linear complementarity problems over Pmatrices (PGLCP), and simple stochastic games. We investigate the combinatorial structure of such orientations and develop randomized algorithms for finding the sink. We show that the orientations arising from PGLCP satisfy the HoltKlee condition known to hold for polytope digraphs, and we give the first expected lineartime algorithms for solving PGLCP with a fixed number of blocks.
Examples and counterexamples for the Perles' conjecture
, 2000
"... The combinatorial structure of a ddimensional simple convex polytope  as given, for example, by the set of the (d 1)regular subgraphs of the facets  can be reconstructed from its abstract graph. However, no polynomial/efficient algorithm is known for this task, although a polynomially check ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
The combinatorial structure of a ddimensional simple convex polytope  as given, for example, by the set of the (d 1)regular subgraphs of the facets  can be reconstructed from its abstract graph. However, no polynomial/efficient algorithm is known for this task, although a polynomially checkable certificate for the correct reconstruction exists. A much stronger certicate would be given by the following characterization of the facet subgraphs, conjectured by M. Perles: "The facet subgraphs of a simple dpolytope are exactly all the (d 1)regular, connected, induced, nonseparating subgraphs." We present nontrivial classes of examples for the validity of the Perles conjecture: In particular, it holds for the duals of cyclic polytopes, and for the duals of stacked polytopes. On the other hand, we observe that for any 4dimensional counterexample, the boundary of the (simplicial) dual polytope P contains a 2complex without a free edge, and without 2dimensional homology. Examples of such complexes are known; we use a modification of "Bing's house" (two walls removed) to construct explicit 4dimensional counterexamples to the Perles conjecture.