𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Generalized Baues Problem for Cyclic Polytopes I

✍ Scribed by Jörg Rambau; Francisco Santos

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

No coin nor oath required. For personal study only.

✦ Synopsis

An important special case of the generalized Baues problem asks whether the order complex of all proper polyhedral subdivisions of a given point configuration, partially ordered by refinement, is homotopy equivalent to a sphere. In this paper, an affirmative answer is given for the vertex sets of cyclic polytopes in all dimensions. This yields the first non-trivial class of point configurations with neither a bound on the dimension, the codimension, nor the number of vertices for which this is known to be true. Moreover, it is shown that all triangulations of cyclic polytopes are lifting triangulations. This contrasts the fact that in general there are many non-regular triangulations of cyclic polytopes. Beyond this, we find triangulations of C(11, 5) with flip deficiency. This proves-among other things-that there are triangulations of cyclic polytopes that are non-regular for every choice of points on the moment curve.

📜 SIMILAR VOLUMES

Fiber Polytopes for the Projections betw
Fiber Polytopes for the Projections between Cyclic Polytopes
✍ Christos A. Athanasiadis; Jesús A. De Loera; Victor Reiner; Francisco Santos 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 359 KB

The cyclic polytope C (n, d) is the convex hull of any n points on the moment curve {(t, t 2 , . . . , t d ) : we consider the fiber polytope (in the sense of Billera and Sturmfels [6]) associated to the natural projection of cyclic polytopes π : C(n, d ) → C(n, d) which 'forgets' the last dd coord

CLOSED FORMULAE FOR THE GENERALIZED ℋ∞ S
CLOSED FORMULAE FOR THE GENERALIZED ℋ∞ SENSITIVITY MINIMIZATION PROBLEM
✍ Keith G. Woodgate 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

The paper presents a complete solution for the multivariable, continuous-time Generalized H (GH ) sensitivity minimization problem. In contrast with existing solutions, derived via polynomial methods, the state-space solution given here is essentially non-iterative. Closed formulae for the minimum a