April 30, 2002
Similar papers 4
February 17, 2017
In this expository note, we review the standard formulation of mirror symmetry for Calabi-Yau hypersurfaces in toric varieties, and compare this construction to a description of mirror symmetry for K3 surfaces which relies on a sublattice of the Picard lattice. We then show how to combine information about the Picard group of a toric ambient space with data about automorphisms of the toric variety to identify families of K3 surfaces with high Picard rank.
July 19, 2012
Even a cursory inspection of the Hodge plot associated with Calabi-Yau threefolds that are hypersurfaces in toric varieties reveals striking structures. These patterns correspond to webs of elliptic-K3 fibrations whose mirror images are also elliptic-K3 fibrations. Such manifolds arise from reflexive polytopes that can be cut into two parts along slices corresponding to the K3 fibers. Any two half-polytopes over a given slice can be combined into a reflexive polytope. This fa...
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 ...
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.
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...
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 11, 2016
We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most eleven lattice points (there are 216,453 of them). In order to achieve this we prove that if $P$ is a lattice 3-polytope of width larger than one and with at least seven lattice points then it fits in one of three categories that we call bo...
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.