Related papers: Curves on surfaces with prescribed pairwise inters…

On a smooth variety, Serre's intersection formula computes intersection multiplicities via an alternating sum of the lengths of Tor groups. When the variety is singular, the corresponding sum can be a divergent series. But there are…

We find a sharp bound for the order of the automorphism group of a stable curve of genus $g$ with $3g-3$ nodes, and a sharp bound for the order of the automorphism group of such a curve with all smooth components. Combined with the results…

In this paper, we study the deformation theory of degenerate algebraic curves on singular varieties which appear as the degenerate limit of families of varieties. For this purpose, we systematically develop a new method to calculate the…

The coloring problem is studied in the paper for graph classes defined by two small forbidden induced subgraphs. We prove some sufficient conditions for effective solvability of the problem in such classes. As their corollary we determine…

We prove that there are $O(n)$ tangencies among any set of $n$ red and blue planar curves in which every pair of curves intersects at most once and no two curves of the same color intersect. If every pair of curves may intersect more than…

Consider two horizontal lines in the plane. A pair of a point on the top line and an interval on the bottom line defines a triangle between two lines. The intersection graph of such triangles is called a simple-triangle graph. This paper…

In the present paper, we study algorithmic questions for the arc-intersection graph of directed paths on a tree. Such graphs are known to be perfect (proved by Monma and Wei in 1986). We present faster algorithms than all previously known…

In this paper we show how, under surprisingly weak assumptions, one can split a planar curve into three arcs and rearrange them (matching tangent directions) to obtain a closed curve. We also generalize this construction to curves split…

We give necessary and sufficient conditions on the curvature and the torsion of a regular curve of the space forms $\h^3$ and $\s^3$ to be contained in a totally umbilical surface. In case that the curve has constant torsion, we obtain the…

We study the minimal degrees and gonalities of curves on complete intersections. We prove a classical conjecture which asserts that the degree of any curve on a general complete intersection $X \subseteq \mathbb{P}^N$ cut out by polynomials…

The defect of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre upper bound for the number of points on the curve. We present algorithms for constructing curves of genus 5,…

We develop a method to find a set of diminimal polyhedral maps on the torus from which all other polyhedral maps on the torus may be generated by face splitting and vertex splitting. We employ this method, though not to its completion, to…

In this paper we give a geometric characterization of the cones of toric varieties that are complete intersections. In particular, we prove that the class of complete intersection cones is the smallest class of cones which is closed under…

For a compact surface $ S $ with a finite set of marked points $ P $, we define a 1-system to be a collection of arcs which are pairwise non-homotopic and intersect pairwise at most once. We prove that, up to equivalence, there are exactly…

Given two general rational curves of the same degree in two projective spaces, one can ask whether there exists a third rational curve of the same degree that projects to both of them. We show that, under suitable assumptions on the degree…

We use twisted stable maps to compute the number of rational degree d plane curves having prescribed contacts to a smooth plane cubic.

A multiple (loc. Cohen Macaulay) structure, X, on a space curve C in P3 is said to be primitive if X is locally contained in a smooth surface. We give numerical conditions for C to be a "primitive" set theoretic complete intersection (i.e.…

This paper proves an elementary topological fact about closed curves on surfaces, namely that by carefully smoothing an intersection point, one can reduce self-intersection by exactly $1$. This immediately implies a positive answer to a…

Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…

We give a method of counting the number of curves with a given type of singularity in a suitably ample linear series on a smooth surface using punctual Hilbert schemes. The types of singulaties for which our methods suffice include the…