Related papers: Addition-deletion results for plus-one generated c…

We prove two theorems on the removal of singularities on the boundary of a pseudo-holomorphic curve. In one theorem, we need no apriori assumption on the area of the curve. The proof uses a doubling argument with the goal of converting…

This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…

We give a criterion when a planar tree-like curve, i.e. a generic immersed plane curve each double point of which cuts it into two disjoint parts, can be send by a diffeomorphism of the plane onto a curve with no inflection points. We also…

In this (mostly) survey article, we give a synopsis of a number of results relating to Brill--Noether theory on curves and metric graphs, together with some speculations about the behavior of one-dimensional linear series on a class of…

The purpose of this paper is to translate positivity properties of the tangent bundle (and the anti-canonical bundle) of an algebraic manifold into existence and movability properties of rational curves and to investigate the impact on the…

We construct Hida and Coleman theories for the degree 0 and 1 cohomology of automorphic line bundles on the modular curve and we define a p-adic duality pairing between the theories in degree 0 and 1.

We investigate how the metric dimension of infinite graphs change when we add edges to the graph. Our two main results: (1) there exists a growing sequence of graphs (under the subgraph relation, but without adding vertices) for which the…

Interpreting tangency as a limit of two transverse intersections, we obtain a concrete formula to enumerate smooth degree $d$ plane curves tangent to a given line at multiple points with arbitrary order of tangency. Extending that idea, we…

This paper considers the task of connecting points on a piece of paper by drawing a curve between each pair of them. Under mild assumptions, we prove that many pairwise disjoint curves are unavoidable if either of the following rules is…

Let $k$ be a perfect field, and $X$ an irreducible smooth projective curve over $k$. We give a criterion for a vector bundle over $X$ to admit a logarithmic connection singular over a finite subset of $X$ with given residues, where residues…

A vertex whose removal in a graph $G$ increases the number of components of $G$ is called a cut vertex. For all $n,c$, we determine the maximum number of connected induced subgraphs in a connected graph with order $n$ and $c$ cut vertices,…

Many degree sequences can only be realised in graphs that contain a `ds-completable card', defined as a vertex-deleted subgraph in which the erstwhile neighbours of the deleted vertex can be identified from their degrees, if one knows the…

We study a connection between two topics: Decoding of Goppa codes arising from an algebraic curve, and rank two extensions of certain line bundles on the curve.

We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…

We characterize the minimal free resolution of zero-dimensional subschemes in the plane with non connected character. This is then used to slightly generalize a result of Sauer about the smoothability of a.C.M. space curves. Some…

We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.

In this paper we propose a direct and explicit realization of addition of divisors by means of an iterative reduction algorithm. Each iteration of the algorithm is the reduction of a degree $g+1$ divisor to a divisor of degree~$g$. Such an…

Given two arbitrary vector bundles on the Fargues-Fontaine curve, we completely classify all vector bundles which arise as their extensions.

Let H be a fixed graph with h vertices. The graph removal lemma states that every graph on n vertices with o(n^h) copies of H can be made H-free by removing o(n^2) edges. We give a new proof which avoids Szemer\'edi's regularity lemma and…

We study the generalized Lam\'e equation on an elliptic curve $E$ with multiple singularities. By restricting to the locus admitting solutions with quasi-periodic properties, we construct two curves: (i) The generalized Lam'e curve: with…