Fiber Polytopes for the Projections between Cyclic Polytopes

نویسندگان

  • Christos A. Athanasiadis
  • Jesús A. De Loera
  • Victor Reiner
  • Francisco Santos
چکیده

The cyclic polytope C(n, d) is the convex hull of any n points on the moment curve {(t, t2, . . . , td ) : t ∈ R} in Rd . For d ′ > 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 d ′ − d coordinates. It is known that this fiber polytope has face lattice indexed by the coherent polytopal subdivisions of C(n, d) which are induced by the map π . Our main result characterizes the triples (n, d, d ) for which the fiber polytope is canonical in either of the following two senses:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Gale and braxial polytopes

Cyclic polytopes are characterized as simplicial polytopes satisfying Gale’s evenness condition (a combinatorial condition on facets relative to a fixed ordering of the vertices). Periodically-cyclic polytopes are polytopes for which certain subpolytopes are cyclic. Bisztriczky discovered a class of periodically-cyclic polytopes that also satisfy Gale’s evenness condition. The faces of these po...

متن کامل

Linear Programming, the Simplex Algorithm and Simple Polytopes

In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes. 

متن کامل

The Generalized Baues Problem for Cyclic Polytopes II Preprint SC 98-43 (Januar 1999) THE GENERALIZED BAUES PROBLEM FOR CYCLIC POLYTOPES II

Given an affine surjection of polytopes : P ! Q, the Generalized Baues Problem asks whether the poset of all proper polyhedral subdivisions of Q which are induced by the map has the homotopy type of a sphere. We extend earlier work of the last two authors on subdivisions of cyclic polytopes to give an affirmative answer to the problem for the natural surjections between cyclic polytopes : C(n; ...

متن کامل

Banach-Mazur Distances and Projections on Random Subgaussian Polytopes

We consider polytopes in Rn that are generated by N vectors in Rn whose coordinates are independent subgaussian random variables. (A particular case of such polytopes are symmetric random ±1 polytopes generated by N independent vertices of the unit cube.) We show that for a random pair of such polytopes the Banach-Mazur distance between them is essentially of a maximal order n. This result is a...

متن کامل

Visualizing 3D Projections of Higher Dimensional Polytopes: An Approach Linking Art and Computers

Visualizing higher dimensional polytopes through computer graphics offers a way to understand and to analyze these interesting objects. Such advantages can be improved by considering polytopes’ three-dimensional projections which are embedded in our space. In this work we will describe basic methodologies for polytopes’ visualization and the way such procedures assist the creation of sculptures...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2000