Related papers: Smooth Fano polytopes arising from finite directed…
In this paper we study the class of polytopes which can be obtained by taking the convex hull of some subset of the points $\{e_i-e_j \ \vert \ i \neq j\} \cup \{\pm e_i\}$ in $\mathbb{R}^n$, where $e_1,\dots,e_n$ is the standard basis of…
We solve the infinitesimal Torelli problem for $3$-dimensional quasi-smooth ${\mathbb{Q}}$-Fano hypersurfaces with at worst terminal singularities. We also find infinite chains of double coverings of increasing dimension which alternatively…
We study the directed polymer model for general graphs (beyond $\mathbb Z^d$) and random walks. We provide sufficient conditions for the existence or non-existence of a weak disorder phase, of an $L^2$ region, and of very strong disorder,…
In this short note, we argue that directed homotopy can be given the structure of generalized modules, over particular monoids. This is part of a general attempt for refoundation of directed topology.
Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…
Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which…
In this paper we consider endomorphisms of a finite directed path from monoid generators perspective. Our main aim is to determine the rank of the monoid $\wEnd\vec{P}_n$ of all weak endomorphisms of a directed path with $n$ vertices, which…
The complexity of graph homomorphism problems has been the subject of intense study. It is a long standing open problem to give a (decidable) complexity dichotomy theorem for the partition function of directed graph homomorphisms. In this…
Given two distributions F and G on the nonnegative integers we propose an algorithm to construct in- and out-degree sequences from samples of i.i.d. observations from F and G, respectively, that with high probability will be graphical, that…
We study the spaces of rational curves on Fano threefolds with Gorenstein terminal singularities. We generalize the results regarding Geometric Manin's Conjecture for smooth Fano threefolds, including the classification of subvarieties with…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
It is known that given a directed graph E and a subset X of vertices, the sum of the projections associated to the vertices in X in the C*-algebra of E converges strictly in the multiplier algebra to a projection P. Here we give a…
In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let $\Gamma$ and $\Gamma'$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\Gamma) \rightarrow V(\Gamma')$ and…
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…
We couple projective limits of probability measures to direct limits of their symmetry groups. We show that the direct limit group is the group of symmetries of the projective limit probability measure. If projective systems of probability…
We show that every non-degenerate regular polytope can be used to construct a thin, residually-connected, chamber-transitive incidence geometry, i.e. a regular hypertope, with a tail-triangle Coxeter diagram. We discuss several interesting…
The Chan-Robbins-Yuen polytope ($CRY_n$) of order $n$ is a face of the Birkhoff polytope of doubly stochastic matrices that is also a flow polytope of the directed complete graph $K_{n+1}$ with netflow $(1,0,0, \ldots , 0, -1)$. The volume…
A graph $G$ with $p$ vertices and $q$ edges is said to be edge-graceful if its edges can be labeled from $1$ through $q$, in such a way that the labels induced on the vertices by adding over the labels of incident edges modulo $p$ are…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
We give an algorithm for finding conformal mappings onto the upper half-plane and conformal modules of some types of polygons. The polygons are obtained by stretching along the real axis polyominoes i.e., polygons which are connected unions…