Related papers: Bend, break and count

We study families of rational curves on an algebraic variety satisfying incidence conditions. We prove an analogue of bend-and-break: that is, we show that under suitable conditions, such a family must contain reducibles. In the case of…

We collect various known results (about plane curves and the moduli space of stable maps) to derive new recursive formulas enumerating low genus plane curves of any degree with various behaviors. Recursive formulas are given for the…

We present an approach to a large class of enumerative problems concerning rational curves in projective spaces. This approach uses analysis to obtain topological information about moduli spaces of stable maps. We demonstrate it by…

Let X be a (possibly nodal) K-trivial threefold moving in a fixed ambient space P. Suppose X contains a continuous family of curves, all of whose members satisfy certain unobstructedness conditions in P. A formula is given for computing the…

We derive recursive equations for the characteristic numbers of rational nodal plane curves with at most one cusp, subject to point conditions, tangent conditions and flag conditions, developing techniques akin to quantum cohomology on a…

We give a formula computing the number of one-nodal rational curves that pass through an appropriate collection of constraints in a complex projective space. We combine the methods and results from three different papers.

In the past 20 years, compactifications of the families of curves in algebraic varieties X have been studied via stable maps, Hilbert schemes, stable pairs, unramified maps, and stable quotients. Each path leads to a different enumeration…

We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{CP}^2$ that pass through $3d+1-m$ generic points and that have an $m$-fold singular point. The special case of counting curves with a triple point was…

We consider the locus of irreducible nonsingular rational curves of degree d Pn, n>2, meeting a generic collection of linear subspaces. When this locus is 0 (resp 1)- dimensional, we compute (recursively) its degree (resp. geometric genus).…

We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{P}^3$, whose image lies in a $\mathbb{P}^2$, passing through $r$ lines and $s$ points, where $r + 2s = 3d+2$. This can be viewed as a family version of…

We solve the problem of computing characteristic numbers of rational space curves with a cusp, where there may or may not be a condition on the node. The solution is given in the form of effective recursions. We give explicit formulas when…

This work is a PhD thesis. First we provide some general context on wonderful varieties and moduli spaces of rational curves. Working over complex numbers we prove that the moduli space of rational curves with no marked points on the…

A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a…

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

A family of plane oriented continuous paths depending on a fixed real positive number $R$ is considered. For any point $x$ on the path, the previous points lie out of any circle of radius $R$ having at $x$ interior normal in a suitable…

Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…

These notes are intended as an easy-to-read supplement to part of the background material presented in my talks on enumerative geometry. In particular, the numbers $n_3$ and $n_4$ of plane rational cubics through eight points and of plane…

We define the concept of a logic frame, which extends the concept of an abstract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the set of axioms are recursively coded. A recursive…

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…

Let X be a projective variety which is covered by a family of rational curves of minimal degree. The classic bend-and-break argument of Mori asserts that if x and y are two general points, then there are at most finitely many curves in that…