Related papers: Smooth Fano polytopes arising from finite directed…
Gorenstein Fano polytopes arising from finite partially ordered sets will be introduced. Then we study the problem which partially ordered sets yield smooth Fano polytopes.
A directed edge polytope $\mathcal{A}_G$ is a lattice polytope arising from root system $A_n$ and a finite directed graph $G$. If every directed edge of $G$ belongs to a directed cycle in $G$, then $\mathcal{A}_G$ is terminal and reflexive,…
We characterize building sets whose associated nonsingular projective toric varieties are Fano. Furthermore, we show that all such toric Fano varieties are obtained from smooth Fano polytopes associated to finite directed graphs.
We classify the d-dimensional simplicial, terminal, and reflexive polytopes with at least 3d-2 vertices. In particular, it turns out that these are all smooth Fano polytopes. This improves on previous results of Casagrande in 2006 and Oebro…
A reflexive polytope, respectively its associated Gorenstein toric Fano variety, is called pseudo-symmetric, if the polytope has a centrally symmetric pair of facets. Here we present a complete classification of pseudo-symmetric simplicial…
We classify terminal simplicial reflexive d-polytopes with 3d-1 vertices. They turn out to be smooth Fano d-polytopes. When d is even there is 1 such polytope up to isomorphism, while there are 2 when d is uneven.
We classify the Fano and reflexive polytopes that arise from quasi-finite Feynman integrals. These polytopes appear as scaled Minkowski sums of the Newton polytopes associated with the Symanzik graph polynomials. For one-loop graphs and…
Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…
Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $\alpha$ of Ehrhart…
Reflexive polytopes form one of the distinguished classes of lattice polytopes. Especially reflexive polytopes which possess the integer decomposition property are of interest. In the present paper, by virtue of the algebraic technique on…
Via the theory of reverse lexicographic squarefree initial ideals of toric ideals, we give a new class of Gorenstein Fano polytopes (reflexive polytopes) arising from a pair of stable set polytopes of perfect graphs.
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
Every countable graph can be built from finite graphs by a suitable infinite process, either adding new vertices randomly or imposing some rules on the new edges. On the other hand, a profinite topological graph is built as the inverse…
In this paper we give several criteria for the edge polytope of a fundamental FHM-graph to possess a regular unimodular triangulation in terms of some simple data of the the graph. We further apply our criteria to several examples of graphs…
We investigate \emph{singular} symmetric and K\"ahler--Einstein Fano polytopes. More precisely, we show that every symmetric Fano polytope is K\"ahler--Einstein generalizing the work by Batyrev and Selivanova, and study the automorphism…
In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…
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…
Let $P$ be a simple polytope with $n-d = 2$, where $d$ is the dimension and $n$ is the number of facets. The graph of such a polytope is also called a grid. It is known that the directed random walk along the edges of $P$ terminates after…
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…