The δ-vectors of reflexive polytopes and of the dual polytopes
نویسنده
چکیده
Abstract. Let δ(P) be the δ-vector of a reflexive polytope P ⊂ R of dimension d and δ(P) the δ-vector of the dual polytope P ⊂ R. In general, δ(P) = δ(P) does not hold. In this paper, we give a higher-dimensional construction of a reflexive polytope whose δ-vector equals the δ-vector of the dual polytope. In particular, we consider the case that the reflexive polytope and the dual polytope are unimodularly equivalent.
منابع مشابه
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.
متن کاملReflexive Polytopes of Higher Index
We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive polygons via a change of the underlying lattice. This allows us to efficiently classify all isomorphism classes of l-reflexive polygons up to index 200. As another ...
متن کاملEhrhart polynomials of convex polytopes with small volumes
Let P ⊂ R be an integral convex polytope of dimension d and δ(P) = (δ0, δ1, . . . , δd) be its δ-vector. By using the known inequalities on δ-vectors, we classify the possible δ-vectors of convex polytopes of dimension d with P
متن کاملReflexive Polytopes of Higher Index and the Number 12
We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive polygons via a change of the underlying lattice. This allows us to efficiently classify all isomorphism classes of l-reflexive polygons up to index 200. As another ...
متن کاملClassifications and volume bounds of lattice polytopes
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular focus on bounds for the volume. In the first paper we give an upper bound on the volume vol(P∗) of a polytope P∗ dual to a d-dimensional lattice polytope P with exactly one interior lattice point, in each dimension d . This bound, expressed in terms of the Sylvester sequence, is sharp, and is ach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 339 شماره
صفحات -
تاریخ انتشار 2016