Related papers: A Viro Theorem without convexity hypothesis for tr…
The aim of this paper is that of discussing Closed Graph Theorems for bornological vector spaces in a way which is accessible to non-experts. We will see how to easily adapt classical arguments of functional analysis over $\mathbb{R}$ and…
Erd\H{o}s conjectured that every triangle-free graph $G$ on $n$ vertices contains a set of $\lfloor n/2 \rfloor$ vertices that spans at most $n^2 /50$ edges. Krivelevich proved the conjecture for graphs with minimum degree at least…
A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…
We prove existence of radially symmetric solutions and validity of Euler-Lagrange necessary conditions for a class of variational problems such that neither direct methods nor indirect methods of Calculus of Variations apply. We obtain…
In enumerative geometry, Virasoro constraints were first conjectured in Gromov-Witten theory with many new recent developments in the sheaf theoretic context. In this paper, we rephrase the sheaf-theoretic Virasoro constraints in terms of…
There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…
In this paper we investigate the problem of lifting of Galois covers between algebraic curves from characteristic p>0 to characteristic 0. We prove a refined version of the main result of Garuti concerning this problem in [Ga]. We formulate…
We present a geometrical approach for studying dimers. We introduce a connection for dimer problems on bipartite and non-bipartite graphs. In the bipartite case the connection is flat but has non-trivial ${\bf Z}_2$ holonomy round certain…
Green's Conjecture predicts than one can read off special linear series on an algebraic curve, by looking at the syzygies of its canonical embedding. We extend Voisin's results on syzygies of K3 sections, to the case of K3 surfaces with…
Thomassen formulated the following conjecture: Every $3$-connected cubic graph has a red-blue vertex coloring such that the blue subgraph has maximum degree $1$ (that is, it consists of a matching and some isolated vertices) and the red…
We consider knot theories possessing a {\em parity}: each crossing is decreed {\em odd} or {\em even} according to some universal rule. If this rule satisfies some simple axioms concerning the behaviour under Reidemeister moves, this leads…
In this paper we consider a generalization of a well known result by Veronese about rational normal curves. More precisely, given a collection of linear spaces in $\PP^n$ we study the existence of rational normal curves intersecting each…
According to the Grothendieck-Lefschetz theorem from SGA 2, there are no nontrivial line bundles on the punctured spectrum $U_R$ of a local ring $R$ that is a complete intersection of dimension $\ge 4$. Dao conjectured a generalization for…
A graph $G$ contains another graph $H$ as an immersion if $H$ can be obtained from a subgraph of $G$ by splitting off edges and removing isolated vertices. There is an obvious necessary degree condition for the immersion containment: if $G$…
We explore the concept of projections of syzygies and prove two new technical results; we firstly give a precise characterization of syzygy schemes in terms of their projections, secondly, we prove a converse to Aprodu's Projection Theorem.…
In algebraic geometry, trigonal curves can always be embedded into Hirzebruch surfaces. In tropical geometry, the notion of trigonality does not have a unique translation. We focus on the characterization in terms of the existence of a…
A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades…
We study minimum degree conditions that guarantee that an $n$-vertex graph is rigid in $\mathbb{R}^d$. For small values of $d$, we obtain a tight bound: for $d = O(\sqrt{n})$, every $n$-vertex graph with minimum degree at least $(n+d)/2 -…
We study the Dirichlet problem for minimal surface systems in arbitrary dimension and codimension via mean curvature flow, and obtain the existence of minimal graphs over arbitrary mean convex bounded $C^2$ domains for a large class of…
In distinction to the Neumann case the squeezing limit of a Dirichlet network leads in the threshold region generically to a quantum graph with disconnected edges, exceptions may come from threshold resonances. Our main point in this paper…