Related papers: Counting lines on projective surfaces

Using degeneration to scrolls, we give an easy proof of non-existence of curves of low genera on general surfaces in P3 of degree d >=5. We show, along the same lines, boundedness of families of curves of small enough genera on general…

On a projective surface it is well-known that the set of curves orthogonal to a nef line bundle is either finite or uncountable. We show that this dichotomy fails in higher dimension by constructing a nef line bundle on a threefold which is…

We improve the best known exponent for the restriction conjecture in R^6. Our idea is applicable to any dimension n satisfying n = 0 mod 3, though we do not explicitly calculate the improvement for n > 6. This improves the recent results of…

The aim of this paper is to get some results about ruled surfaces which configure a projective theory of scrolls and ruled surfaces. Our ideas follow the viewpoint of Corrado Segre, but we employ the contemporaneous language of locally free…

We give an explicitly computable lower bound for the arithmetic self-intersection number of the dualizing sheaf on a large class of arithmetic surfaces. If some technical conditions are satisfied, then this lower bound is positive. In…

Let $(S,\mathcal L)$ be a smooth, irreducible, projective, complex surface, polarized by a very ample line bundle $\mathcal L$ of degree $d > 25$. In this paper we prove that $\chi (\mathcal O_S)\geq -\frac{1}{8}d(d-6)$. The bound is sharp,…

Given d in IN, we prove that any polarized Enriques surface (over any field of characteristic different from 2 or with a smooth K3 cover) of degree greater than 12d^2 contains at most 12 rational curves of degree at most d. For d>2 we…

We prove a new upper bound on the number of $r$-rich lines (lines with at least $r$ points) in a `truly' $d$-dimensional configuration of points $v_1,\ldots,v_n \in \mathbb{C}^d$. More formally, we show that, if the number of $r$-rich lines…

We study ramified covers of the projective plane. Given a smooth projective surface S and a generic enough projection of S to the projective plane, we get a cover of the plane ramified over a plane curve. The branch curve is usually…

We prove crossing number inequalities for geometric graphs whose vertex sets are taken from a d-dimensional grid of volume N and give applications of these inequalities to counting the number of non-crossing geometric graphs that can be…

We show that the 1-planar slope number of 3-connected cubic 1-planar graphs is at most 4 when edges are drawn as polygonal curves with at most 1 bend each. This bound is obtained by drawings whose vertex and crossing resolution is at least…

This is an incomplete attempt to show that the upper bound of $\lesssim n^\frac{4}{3}$ on the number unit distances determined by a large finite set of $n$ points in the plane is not sharp. The methods also say something about sets of $n$…

We prove that there exist smooth surfaces of degree d in projective 3-space such that the group of rational equivalence classes of decomposable 0-cycles has rank at least the integer part of (d-1)/3.

We study the geometry of quartic surfaces in IP^3 that contain a line of the second kind over algebraically closed fields of characteristic different from 2,3. In particular, we correct Segre's claims made for the complex case in 1943.

The main goal of this work is to prove that every entire curve in a smooth hypersurface of degree greater than or equal to 97 in the complex projective space of dimension 4 must satisfy an algebraic differential equation of order 3. A…

A long standing question is if maximum number $\mu(d)$ of nodes on a surface of degree $d$ in $\dP^3(\dC)$ can be achieved by a surface defined over the reals which has only real singularities. The currently best known asymptotic lower…

The Hilbert scheme of projective 3-folds of codimension 3 or more that are linear scrolls over the projective plane or over a smooth quadric surface or that are quadric or cubic fibrations over the projective line is studied. All known such…

We first review some topics in the classical computational geometry of lines, in particular the O(n^{3+\epsilon}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description…

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

In characteristic $p>0$ and for $q$ a power of $p$, we compute the number of nonplanar rational curves of arbitrary degrees on a smooth Hermitian surface of degree $q+1$ under the assumption that the curves have a parametrization given by…