Related papers: Smooth Fano polytopes arising from finite directed…
We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.
We prove analogues of classical results for higher homotopy groups and singular homology groups of pseudotopological spaces. Pseudotopological spaces are a generalization of (\v{C}ech) closure spaces which are in turn a generalization of…
We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…
Let $G$ be a finite graph allowing loops, having no multiple edge and no isolated vertex. We associate $G$ with the edge polytope ${\cal P}_G$ and the toric ideal $I_G$. By classifying graphs whose edge polytope is simple, it is proved that…
The k-th power D^k of a directed graph D is defined to be the directed graph on the vertices of D with an arc from a to b in D^k iff one can get from a to b in D with exactly k steps. This notion is equivalent to the k-fold composition of…
We exhibit full exceptional collections of vector bundles on any smooth, Fano arithmetic toric variety whose split fan is centrally symmetric.
We prove the Yau-Tian-Donaldson's conjecture for any $\mathbb{Q}$-Fano variety that has a log smooth resolution of singularities such that the discrepancies of all exceptional divisors are non-positive. In other words, if such a Fano…
In the field of graph signal processing (GSP), directed graphs present a particular challenge for the "standard approaches" of GSP to due to their asymmetric nature. The presence of negative- or complex-weight directed edges, a graphical…
We obtain faster expander decomposition algorithms for directed graphs, matching the guarantees of Saranurak and Wang (SODA 2019) for expander decomposition on undirected graphs. Our algorithms are faster than prior work and also generalize…
In this note we make progress toward a conjecture of Durham--Fanoni--Vlamis, showing that every infinite-type surface with finite-invariance index 1 and no nondisplaceable compact subsurfaces fails to have a good curve graph, that is, a…
We describe the full automorphism group of the directed reduced power graph and the undirected reduced power graph of a finite group. We compute the full automorphism groups of these graphs of several classes of finite groups. Also, we…
Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…
Symmetric varieties are normal equivarient open embeddings of symmetric homogeneous spaces, and they are interesting examples of spherical varieties. We prove that all smooth Fano symmetric varieties with Picard number one admit…
The question of shellability of complexes of directed trees was asked by R. Stanley. D. Kozlov showed that the existence of a complete source in a directed graph provides a shelling of its complex of directed trees. We will show that this…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
The graphical notion of effective resistance has found wide-ranging applications in many areas of pure mathematics, applied mathematics and control theory. By the nature of its construction, effective resistance can only be computed in…
We characterise the quotient surface graphs arising from symmetric contact systems of line segments in the plane and also from symmetric pointed pseudotriangulations in the case where the group of symmetries is generated by a translation or…
We prove that every finite group is the automorphism group of a finite abstract polytope isomorphic to a face-to-face tessellation of a sphere by topological copies of convex polytopes. We also show that this abstract polytope may be…
It is shown that the toric ideal of the centrally symmetric configuration of the order polytope of a finite partially ordered set possesses a squarefree quadratic initial ideal. It then follows that the convex polytope arising from the…
Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive…