Completely unimodal numberings of a simple polytope |
| |
Institution: | Department of Mathematics, University of Richmond, VA 23173, USA |
| |
Abstract: | A completely unimodal numbering of the m vertices of a simple d-dimensional polytope is a numbering 0, 1, …,m?1 of the vertices such that on every k-dimensional face (2≤k≤d) there is exactly one local minimum (a vertex with no lower-numbered neighbors on that face). Such numberings are abstract objective functions in the sense of Adler and Saigal 1]. It is shown that a completely unimodal numbering of the vertices of a simple polytope induces a shelling of the facets of the dual simplicial polytope. The h-vector of the dual simplicial polytope is interpreted in terms of the numbering (with respect to using a local-improvement algorithm to locate the vertex numbered 0). In the case that the polytope is combinatorially equivalent to a d-dimensional cube, a ‘successor-tuple’ for each vertex is defined which carries the crucial information of the numbering for local-improvement algorithms. Combinatorial properties of these d-tuples are studied. Finally the running time of one particular local-improvement algorithm, the Random Algorithm, is studied for completely unimodal numberings of the d-cube. It is shown that for a certain class of numberings (which includes the example of Klee and Minty 8] showing that the simplex algorithm is not polynomial and all Hamiltonian saddle-free injective pseudo-Boolean functions 6]) this algorithm has expected running time that is at worst quadratic in the dimension d. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|