Related papers: Bend, break and count
In this paper we obtain an explicit formula for the number of degree d curves in two dimensional complex projective space, passing through (d(d+3)/2 -k) generic points and having a codimension k singularity, where k is at most 7. In the…
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…
This paper contains an attempt to formulate rigorously and to check predictions in enumerative geometry of curves following from Mirror Symmetry. The main tool is a new notion of stable map. We give an outline of a contsruction of…
In this article we prove the explicit Mordell Conjecture for large families of curves. In addition, we introduce a method, of easy application, to compute all rational points on curves of quite general shape and increasing genus. The method…
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…
We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…
Classical planning asks for a sequence of operators reaching a given goal. While the most common case is to compute a plan, many scenarios require more than that. However, quantitative reasoning on the plan space remains mostly unexplored.…
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and vertices. This paper presents an implementation of these…
We prove that a complete family of linearly non-degenerate rational curves of degree $e > 2$ in $\mathbb{P}^n$ has at most $n-1$ moduli. For $e = 2$ we prove that such a family has at most $n$ moduli. It is unknown whether or not this is…
Let $X$ be a smooth complex projective variety. Using a construction devised to Gathmann, we present a recursive formula for some of the Gromov-Witten invariants of $X$. We prove that, when $X$ is homogeneous, this formula gives the number…
A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of…
One distinguishing feature of rational curves is that they have algebraic parameterizations. Arc spaces are a way of describing approximations to parameterizations of all curves in some fixed space. Playing on these descriptions, this paper…
Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.
There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…
Given a smooth cubic hypersurface $X$ over a finite field of characteristic greater than 3 and two generic points on $X$, we use a function field analogue of the Hardy-Littlewood circle method to obtain an asymptotic formula for the number…
We construct entire curves in projective spaces that exhibit frequent hypercyclicity under translations along countably many prescribed directions while maintaining optimal slow growth rates. Furthermore, we establish a fundamental…
We develop a new general method for computing the decomposition type of the normal bundle to a projective rational curve. This method is then used to detect and explain an example of a Hilbert scheme that parametrizes all the rational…
This paper is an elementary introduction to the theory of moduli spaces of curves and maps. As an application to enumerative geometry, we show how to count the number of bitangent lines to a projective plane curve of degree $d$ by doing…
The purpose of this note is to prove that there is an algebraic stack U parameterizing all curves. The curves that appear in the algebraic stack U are allowed to be arbitrarily singular, non-reduced, disconnected, and reducible. We also…
For normally reflected Brownian motion and for simple random walk on independently growing in time d-dimensional domains, d>=3, we establish a sharp criterion for recurrence versus transience in terms of the growth rate.