Related papers: The web of reflexive polygons is connected
Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this thesis we explore this correspondence to classify smooth lattice…
Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…
Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this paper we explore this correspondence to classify smooth lattice polytopes…
It is known that, adding the number of lattice points lying on the boundary of a reflexive polygon and the number of lattice points lying on the boundary of its polar, always yields 12. Generalising appropriately the notion of reflexivity,…
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…
We introduce a collection of convex polytopes associated to a torus-equivariant vector bundle on a smooth complete toric variety. We show that the lattice points in these polytopes correspond to generators for the space of global sections…
Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…
For every finite Petri net, we construct a commutative polynomial in two variables and with coefficients from the semiring of natural numbers. We also present an inverse construction and show that multiplication of polynomials…
We develop some concrete methods to build Sarkisov links, starting from Mori fibre spaces. This is done by studying low rank Cox rings and their properties. As part of this development, we give an algorithm to construct explicitly the…
We describe Galois connections which arise between two kinds of combinatorial structures, both of which generalize trees with labelled leaves, and then apply those connections to a family of polytopes. The graphs we study can be imbued with…
Lattices generated by lattice points in skeletons of reflexive polytopes are essential in determining the fundamental group and integral cohomology of Calabi-Yau hypersurfaces. Here we prove that the lattice generated by all lattice points…
We use the notions of reflexivity and of reflexive dimensions in order to introduce probability measures for lattice polytopes and initiate the investigation of their statistical properties. Examples of applications to discrete geometry…
We prove the following "linkage" theorem: two p-regular graphs of the same genus can be obtained from one another by a finite alternating sequence of one-edge-contractions; moreover this preserves 3-edge-connectivity. We use the linkage…
We can run the MMP for any divisor on any $\mathbb{Q}$-factorial projective toric variety. We show that two Mori fiber spaces, which are outputs of the above MMP, are connected by finitely many elementary transforms.
Let $X_{P}$ be the projective toric surface associated to a lattice polytope $P$. If the number of lattice points lying on the boundary of $P$ is at least $4$, it is known that $X_{P}$ is embeddable into a suitable projective space as zero…
In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…
We introduce an algorithm that exploits a combinatorial symmetry of an arrangement in order to produce a geometric reflection between two disconnected components of its moduli space. We apply this method to disqualify three real examples…
We describe our package PALP of C programs for calculations with lattice polytopes and applications to toric geometry, which is freely available on the internet. It contains routines for vertex and facet enumeration, computation of…
We describe the emergence of the giant mutually connected component in networks of networks in which each node has a single replica node in any layer and can be interdependent only on its replica nodes in the interdependent layers. We prove…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…