𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cyclic Polytopes and Oriented Matroids

✍ Scribed by Raul Cordovil; Pierre Duchet


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
244 KB
Volume
21
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis


Consider the moment curve in the real euclidean space R d defined parametrically by the map Ξ³ : R β†’ R d , t β†’ Ξ³ (t) = (t, t 2 , . . . , t d ). The cyclic d-polytope C d (t 1 , . . . , t n ) is the convex hull of n > d different points on this curve. The matroidal analogs are the alternating oriented uniform matroids. A polytope (resp. matroid polytope) is called cyclic if its face lattice is isomorphic to that of C d (t 1 , . . . , t n ). We give combinatorial and geometrical characterizations of cyclic (matroid) polytopes. A simple evenness criterion determining the facets of C d (t 1 , . . . , t n ) was given by Gale [21]. We characterize the admissible orderings of the vertices of the cyclic polytope, i.e., those linear orderings of the vertices for which Gale's evenness criterion holds. Proofs give a systematic account on an oriented matroid approach to cyclic polytopes.


πŸ“œ SIMILAR VOLUMES


Lawrence Oriented Matroids and a Problem
✍ J.L. RamΔ±́rez AlfonsΔ±́n πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 107 KB

Consider the following question introduced by McMullen: Determine the largest integer n = f (d) such that any set of n points in general position in the affine d-space R d can be mapped by a projective transformation onto the vertices of a convex polytope. It is known that 2d + 1 ≀ f (d) < (d + 1)(d

Oriented Matroids and Hyperplane Transve
✍ Laura Anderson; Rephael Wenger πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 401 KB

We prove that a finite family A of compact connected sets in R d has a hyperplane transversal if and only if for some k, 0<k<d, there exists an acyclic oriented matroid of rank k+1 on A such that every k+2 sets in A have an oriented k-transversal which meets the sets consistently with that oriented

Oriented Matroids and Combinatorial Mani
✍ Raul Cordovil; Komei Fukuda πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 240 KB

An oriented matroid lattice is a lattice arising from the span of cocircuits of an oriented matroid ordered by conformal relation. One important subclass of the o.m. lattices is the polars of face lattices of zonotopes. In this paper we show that every o.m. lattice is a (combinatorial) manifold. Thi

Cyclic degree and cyclic coloring of 3-p
✍ Borodin, Oleg V. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 402 KB πŸ‘ 1 views

A vertex coloring of a plane graph is called cyclic if the vertices in each face bounding cycle are colored differently. The main result is an improvement of the upper bound for the cyclic chromatic number of 3-polytopes due to Plummer and Toft, 1987 (J. Graph Theory 11 (1 987) 505-51 7). The proof

Oriented Rank Three Matroids and Project
✍ Franz B. Kalhoff πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 259 KB

Recently, Goodman et al. [9,10] have proven two conjectures by GrΓΌnbaum right, showing that any arrangement of pseudolines in the plane can be embedded into a flat projective plane and that there exists a universal topological projective plane in which every arrangement of pseudolines is stretchable