Related papers: Smooth Fano polytopes arising from finite directed…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…
Although asymptotic analyses of undirected network models based on degree sequences have started to appear in recent literature, it remains an open problem to study statistical properties of directed network models. In this paper, we…
We prove that the derived category of a smooth complete intersection variety is equivalent to a full subcategory of the derived category of a smooth projective Fano variety. This enables us to define some new invariants of smooth projective…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
We study Fano manifolds of pseudoindex greater than one and dimension greater than five, which are blow-ups of smooth varieties along smooth centers of dimension equal to the pseudoindex of the manifold. We obtain a classification of the…
We consider a smooth projective morphism between smooth complex projective varieties. If the source space is a weak Fano (or Fano) manifold, then so is the target space. Our proof is Hodge theoretic. We do not need mod $p$ reduction…
We consider weak Fano manifolds with small contractions obtained by blowing up successively curves and subvarieties of codimension 2 in products of projective spaces. We give a classification result for a special case. In the process of…
We develop a general approach to prove K-stability of Fano varieties. The new theory is used to (a) prove the existence of K\"ahler-Einstein metrics on all smooth Fano hypersurfaces of Fano index two, (b) to compute the stability thresholds…
Given a convex polytope, we define its geometric spectrum, a stacky version of Batyrev's stringy E-functions, and we prove a stacky version of a formula of Libgober and Wood about the E-polynomial of a smooth projective variety. As an…
We give an efficient perfect sampling algorithm for weighted, connected induced subgraphs (or graphlets) of rooted, bounded degree graphs. Our algorithm utilizes a vertex-percolation process with a carefully chosen rejection filter and…
Determining when the birational automorphism group of a Fano variety is finite is an interesting and difficult problem. The main technique for studying this problem is by the Noether-Fano method. This method has been effective in studying…
In this paper, we show new strongly polynomial work-depth tradeoffs for computing single-source shortest paths (SSSP) in non-negatively weighted directed graphs in parallel. Most importantly, we prove that directed SSSP can be solved within…
We prove that every 2k-edge-connected graph with countably many edge-ends admits a k-arc-connected orientation, extending the previous result by Assem, Koloschin and Pitz that also assumed the hypothesis of the graph being locally finite.…
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…
A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hyperplanes. In this paper, we investigate unconditional lattice polytopes with respect to geometric, combinatorial, and algebraic properties.…
Luis Ferroni and Alex Fink recently introduced a polytope of all unlabeled matroids of rank $r$ on $n$ elements, and they showed that the vertices of this polytope come from matroids that can be characterized by maximizing a sequence of…
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…
A directed diameter of a directed graph is the maximum possible distance between a pair of vertices, where paths must respect edge orientations, while undirected diameter is the diameter of the undirected graph obtained by symmetrizing the…
Every generic linear functional $f$ on a convex polytope $P$ induces an orientation on the graph of $P$. From the resulting directed graph one can define a notion of $f$-arborescence and $f$-monotone path on $P$, as well as a natural graph…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…