相关论文: A Viro Theorem without convexity hypothesis for tr…

We show that a general curve in an explicit class of what we call Du Val pointed curves satisfies the Brill-Noether Theorem for pointed curves. Furthermore, we prove that a generic pencil of Du Val pointed curves is disjoint from all…

Motivated by a result of [1] which states that if F is a subgraph of a convex complete graph K_n and F contains no boundary edge of K_n and |E(F)| \leq n-3, then K_n - F admits a triangulation, we determine necessary and sufficient…

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

Let H = (H,V) be a hypergraph with edge set H and vertex set V. Then hypergraph H is invertible iff there exists a permutation pi of V such that for all E belongs to H(edges) intersection of(pi(E) and E)=0. H is invertibility critical if H…

We discuss some variants of cone theorem for movable curves in any codimensions.

A conjecture expressing genus 1 Gromov-Witten invariants in mirror-theoretic terms of semi-simple Frobenius structures and complex oscillating integrals is formulated. The proof of the conjecture is given for torus-equivariant Gromov -…

We show that, once translated to the dual setting of convex triangulations of lattice polytopes, results and methods from previous tropical works by Arnal-Renaudineau-Shaw, Renaudineau-Shaw, Renaudineau-Rau-Shaw, and Jell-Rau-Shaw extend to…

An important result of Koml\'os [Tiling Tur\'an theorems, Combinatorica, 2000] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$-tiling covering an $x$th proportion of the vertices of $G$ (for…

Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…

The rainbow arborescence conjecture posits that if the arcs of a directed graph with $n$ vertices are colored by $n-1$ colors such that each color class forms a spanning arborescence, then there is a spanning arborescence that contains…

The first two authors introduced vertex distortion and showed that the vertex distortion of the unknot is trivial. It was conjectured that the vertex distortion of a knot is trivial if and only if the knot is trivial. We will use…

We develop a technique that allows us to prove results about subvarieties of general type hypersurfaces. As an application, we use a result of Clemens and Ran to prove that a very general hypersurface of degree (3n+1)/2 \leq d \leq 2n-3…

We show that the virial theorem provides a useful simple tool for approximating nonlinear problems. In particular we consider conservative nonlinear oscillators and a bifurcation problem. In the former case we obtain the same main result…

We construct geometric barriers for minimal graphs in H^n xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in H^n extending continuously to the interior of each…

Self-rational maps of generic algebraic K3 surfaces are conjectured to be trivial. We relate this conjecture to a conjecture concerning the irreducibility of the universal Severi varieties parametrizing nodal curves of given genus and…

Vogt's theorem, concerning boundary angles of a convex arc with monotonic curvature (spiral arc), is taken as a starting point to establish basic properties of spirals. The theorem is expanded by removing requirements of convexity and…

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any…

In this paper we prove a convexity and fibre-connectedness theorem for proper maps constructed by Thimm's trick on a connected Hamiltonian $G$-space $M$ that generate a Hamiltonian torus action on an open dense submanifold. Since these maps…

We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an $n$-vertex graph $G$ with sublinear independence number. In this setting, we show that if $\delta(G) \ge n/3 + o(n)$ then…

The geometric models for the module category and derived category of any gentle algebra were introduced to realize the objects in module category and derived category by permissible curves and admissible curves respectively. The present…