April 30, 2002
Similar papers 4
March 8, 2013
A Gorenstein polytope of index r is a lattice polytope whose r-th dilate is a reflexive polytope. These objects are of interest in combinatorial commutative algebra and enumerative combinatorics, and play a crucial role in Batyrev's and Borisov's computation of Hodge numbers of mirror-symmetric generic Calabi-Yau complete intersections. In this paper, we report on what is known about smooth Gorenstein polytopes, i.e., Gorenstein polytopes whose normal fan is unimodular. We cl...
February 9, 2006
In this paper for any dimension n we give a complete list of lattice convex polytopes in R^n that are regular with respect to the group of affine transformations preserving the lattice.
October 12, 2022
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on the well-known geometric interpretations of matrix model digram techniques, we construct a new model that enumerates triangulations, subdivisions, and numbers of integral points of integral polygons. This approach allows us to look at their ...
September 26, 2019
This paper proposes a novel and simple algorithm of facet enumeration for convex polytopes. The complexity of the algorithm is discussed. The algorithm is implemented in Matlab. Some simple polytopes with known H-representations and V-representations are used as the test examples. Numerical test shows the effectiveness and efficiency of the proposed algorithm. Due to the duality between the vertex enumeration problem and facet enumeration problem, we expect that this method c...
May 24, 2004
We investigate Gorenstein toric Fano varieties by combinatorial methods using the notion of a reflexive polytope which appeared in connection to mirror symmetry. The paper contains generalisations of tools and previously known results for nonsingular toric Fano varieties. As applications we obtain new classification results, bounds of invariants and formulate conjectures concerning combinatorial and geometrical properties of reflexive polytopes.
January 5, 2023
This work presents the tessellations and polytopes from the perspective of both n-dimensional geometry and abstract symmetry groups. It starts with a brief introduction to the terminology and a short motivation. In the first part, it engages in the construction of all regular tessellations and polytopes of n dimensions and extends this to the study of their quasi-regular and uniform generalizations. In the second part, the symmetries of polytopes and tessellations are conside...
March 1, 2011
In this paper we study the classification problem of convex lattice ploytopes with respect to given volume or given cardinality.
November 8, 2017
polyDB is a database for discrete geometric objects. The database is accessible via web and an interface from the software package polymake. It contains various datasets from the area of lattice polytopes, combinatorial polytopes, matroids and tropical geometry. In this short note we introduce the structure of the database and explain its use with a computation of the free sums and certain skew bipyramids among the class of smooth Fano polytopes in dimension up to 8.
February 20, 2002
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The problems are grouped into the sections ``Coordinate Descriptions'', ``Combinatorial Structure'', ``Isomorphism'', ``Optimization'', ``Realizability'', and ``Beyond Polytopes''.
November 7, 2013
These notes are based on three lectures given at the 2013 CIME/CIRM summer school. The purpose of this series of lectures is to introduce the notion of a toric fibration and to give its geometrical and combinatorial characterizations. Polarized toric varieties which are birationally equivalent to projective toric bundles are associated to a class of polytopes called Cayley polytopes. Their geometry and combinatorics have a fruitful interplay leading to fundamental insight in ...