Related papers: Bend, break and count

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 examples of sequences of smooth non-isotrivial curves for every genus at least two, defined over a rational function field of positive characteristic, such that the (finite) number of rational points of the curves in the sequence…

The main purpose is to estimate the regression function of a real random variable with functional explanatory variable by using a recursive nonparametric kernel approach. The mean square error and the almost sure convergence of a family of…

Let C be a general connected, smooth, projective curve of positive genus g. For each nonnegative integer i we give formulas for the number of pairs (P,Q) em C x C off the diagonal such that (g+i-1)Q-(i+1)P is linearly equivalent to an…

We prove that every bounded rational space curve of degree d and circularity c can be drawn by a linkage with 9/2 d - 6c + 1 revolute joints. Our proof is based on two ingredients. The first one is the factorization theory of motion…

We obtain a recursive formula answering the following question: How many irreducible, plane curves of degree d and (geometric) genus g pass through 3d-1+g general points in the plane? The formula is proved by studying suitable degenerations…

A rational triangle is a triangle with rational side lengths. We consider three different families of rational triangles having a fixed side and whose vertices are rational points in the plane. We display a one-to-one correspondence between…

Let X be an Abelian surface and C a holomorphic curve in X representing a primitive homology class. The space of genus g curves in the class of C is g dimensional. We count the number of such curves that pass through g generic points and we…

Let $X$ be an irreducible projective variety of dimension $n$ in a projective space and let $x$ be a point of $X$. Denote by ${\rm Curves}_d(X,x)$ the space of curves of degree $d$ lying on $X$ and passing through $x$. We will show that the…

We determine all of lines in the moduli space $M$ of stable bundles for arbitrary rank and degree. A further application of minimal rational curves is also given in last section.

A new, simple method to approach enumerative questions about rational curves on rational surfaces is described. Applications include a short proof of Kontsevich's formula for plane curves and a the solution of the analogous problem for the…

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

We consider the reduction of an elliptic curve defined over the rational numbers modulo primes in a given arithmetic progression and investigate how often the subgroup of rational points of this reduced curve is cyclic as a special case of…

The Eynard-Orantin recursion formula provides an effective tool for certain enumeration problems in geometry. The formula requires a spectral curve and the recursion kernel. We present a uniform construction of the spectral curve and the…

Let $X$ be a real algebraic convex 3-manifold whose real part is equipped with a $Pin^-$ structure. We show that every irreducible real rational curve with non-empty real part has a canonical spinor state belonging to $\{\pm 1\}$. The main…

In this paper we study the geometry of the Severi varieties parametrizing curves on the rational ruled surface $\fn$. We compute the number of such curves through the appropriate number of fixed general points on $\fn$, and the number of…

We develop a formula (Theorem 5.1) which allows to compute top Chern classes of vector bundles on the vanishing locus $V(s)$ of a section of this bundle. This formula particularly applies in the case when $V(s)$ is the union of locally…

Reversible computing is motivated by both pragmatic and foundational considerations arising from a variety of disciplines. We take a particular path through the development of reversible computation, emphasizing compositional reversible…

This paper is a brief and informal presentation of cirquent calculus, a novel proof system for resource-conscious logics. As such, it is a refinement of sequent calculus with mechanisms that allow to explicitly account for the possibility…

In this expository paper we show how one can, in a uniform way, calculate the weight distributions of some well-known binary cyclic codes. The codes are related to certain families of curves, and the weight distributions are related to the…