A Correspondence between Generic Alcoved Polytopes and Subdivisions of the Root Polytope of Lie Type A

نویسنده

  • YiYu Zhang
چکیده

Alcoved polytopes of Lie type A are polytopes whose facets are orthognal to the roots of root system An−1. An alcoved polytope of type An−1 is generic if it has two facets orthogonal to each root in An−1. In this paper, we prove that there is one-to-one correspondence between equivalence classes of generic alcoved polytopes of type An−1 and regular central subdivisions of the root polytope of An−1. We apply this result to give an explicit classification for small n.

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

ثبت نام

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

منابع مشابه

Borns-Weil and Kavish Gandhi, Bounds on Moment-Based Learning of Mixture Distributions (mentor Will Perry) 10:10 am: YiYu Zhang, Correspondence between Generic Alcoved Polytopes and Sub- divisions of the Root Polytope of Lie Type A (mentor

Room 2-449 9:30 am Conference Opening, by SPUR Faculty Advisors Prof. David Jerison and Prof. Ankur Moitra 9:40 am: Yonah Borns-Weil and Kavish Gandhi, Bounds on Moment-Based Learning of Mixture Distributions (mentor Will Perry) 10:10 am: YiYu Zhang, Correspondence between Generic Alcoved Polytopes and Subdivisions of the Root Polytope of Lie Type A (mentor Pavel Galashin) 10:40 am: Jonathan Ti...

متن کامل

Symmetric Alcoved Polytopes

Generalized alcoved polytopes are polytopes whose facet normals are roots in a given root system. We call a set of points in an alcoved polytope a generating set if there exists no strictly smaller alcoved polytope containing it. The type A alcoved polytopes are precisely the convex polytopes that are also tropically convex. In this case the tropical generators form a generating set. We show th...

متن کامل

Solving multiobjective linear programming problems using ball center of polytopes

Here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎The algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎Numerical examples and a simulation study are used to illu...

متن کامل

Decomposing the Secondary Cayley Polytope

The vertices of the secondary polytope of a point connguration correspond to its regular triangulations. The Cayley trick links triangulations of one point connguration, called the Cayley polytope, to the ne mixed subdivisions of a tuple of point conngurations. In this paper we investigate the secondary polytope of this Cayley polytope. Its vertices correspond to all regular mixed subdivisions ...

متن کامل

On the Reenements of a Polyhedral Subdivision

Let : P ! Q be an aane projection map between two polytopes P and Q. Billera and Sturmfels introduced in 1992 the concept of polyhedral subdivisions of Q induced by (or-induced) and the ber polytope of the projection: a polytope (P;) of dimension dim(P) ? dim(Q) whose faces are in correspondence with the coherent-induced subdivisions (or-coherent subdivisions). In this paper we investigate the ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016