English
Related papers

Related papers: Curve Counting \`a la G\"ottsche

200 papers

Let $C_1,C_2\subseteq\mathbb{G}_m^N(\mathbb{C})$ be irreducible closed algebraic curves, with $N\geq 3$. Suppose $C_1$ is not contained in an algebraic subgroup of $\mathbb{G}_m^N(\mathbb{C})$ of dimension $1$ and $C_1\cup C_2$ is not…

Algebraic Geometry · Mathematics 2024-01-11 Gareth Boxall

In this paper, we prove an explicit upper bound on the number of rational points on a smooth projective curve of genus at least two over a number field. This gives explicit constants in the uniform Mordell conjecture proposed by Mazur and…

Number Theory · Mathematics 2026-02-03 Jiawei Yu , Xinyi Yuan , Shengxuan Zhou

We describe a search for plane-filling curves traversing all edges of a grid once. The curves are given by Lindenmayer systems with only one non-constant letter. All such curves for small orders on three grids have been found. For all…

Combinatorics · Mathematics 2018-07-04 Jörg Arndt

We push further the classical proof of Weil upper bound for the number of rational points of an absolutely irreducible smooth projective curve $X$ over a finite field in term of euclidean relationships between the Neron Severi classes in…

Number Theory · Mathematics 2014-09-09 Emmanuel Hallouin , Marc Perret

Let $C$ be a smooth projective curve and $W$ a symplectic bundle over $C$. Let $LQ_e (W)$ be the Lagrangian Quot scheme parametrizing Lagrangian subsheaves $E \subset W$ of degree $e$. We give a closed formula for intersection numbers on…

Algebraic Geometry · Mathematics 2019-03-12 Daewoong Cheong , Insong Choe , George H. Hitching

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…

Metric Geometry · Mathematics 2007-05-23 Frank Sottile , Thorsten Theobald

In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…

Differential Geometry · Mathematics 2014-05-20 Chong-Jun Li , Ren-Hong Wang

By considering mirror symmetry applied to conformal field theories corresponding to strings propagating in quintic hypersurfaces in projective 4-space, Candelas, de la Ossa, Green and Parkes calculated the ``number of rational curves on the…

High Energy Physics - Theory · Physics 2008-02-03 Sheldon Katz

One of the big questions in the area of curves over finite fields concerns the distribution of the numbers of points: Which numbers occur as the number of points on a curve of genus $g$? The same question can be asked of various subclasses…

Algebraic Geometry · Mathematics 2010-12-02 Gary McGuire , Alexey Zaytsev

We discuss the problem of counting vertices in Gelfand-Zetlin polytopes. Namely, we deduce a partial differential equation with constant coefficients on the exponential generating function for these numbers. For some particular classes of…

Combinatorics · Mathematics 2014-06-06 Pavel Gusev , Valentina Kiritchenko , Vladlen Timorin

The number of rational points of a plane non-singular algebraic curve X defined over a finite field is computed, provided that the generic point of X is not an inflexion and that X is Frobenius non-classical with respect to conics.

Number Theory · Mathematics 2007-05-23 Massimo Giulietti

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…

Algebraic Geometry · Mathematics 2007-05-23 Heather Russell

We give an arithmetic count of the lines on a smooth cubic surface over an arbitrary field $k$, generalizing the counts that over $\mathbb{C}$ there are $27$ lines, and over $\mathbb{R}$ the number of hyperbolic lines minus the number of…

Algebraic Geometry · Mathematics 2021-07-01 Jesse Leo Kass , Kirsten Wickelgren

In this paper we provide a computational approach to the shape of curves which are rational in polar coordinates, i.e. which are defined by means of a parametrization (r(t),\theta(t)) where both r(t),\theta(t) are rational functions. Our…

Symbolic Computation · Computer Science 2015-02-17 J. G. Alcázar , G. M. Díaz-Toca

We give explicit formulas for the number of points on reductions of elliptic curves with complex multiplication by any imaginary quadratic field. We also find models for CM $\mathbf{Q}$-curves in certain cases. This generalizes earlier…

Number Theory · Mathematics 2009-08-06 K. Rubin , A. Silverberg

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

Combinatorics · Mathematics 2015-10-30 G. A. T. F da Costa , M. Policarpo

In part 1 (Chapter 2) we present the basic notions of Loewner theory. Here we use a modern form which was developed by F. Bracci, M. Contreras, S. D\'iaz-Madrigal et al. and which can be applied to certain higher dimensional complex…

Complex Variables · Mathematics 2015-01-20 Sebastian Schleissinger

Let N_q(g) denote the maximal number of F_q-rational points on any curve of genus g over the finite field F_q. Ihara (for square q) and Serre (for general q) proved that limsup_{g-->infinity} N_q(g)/g > 0 for any fixed q. In their proofs…

Algebraic Geometry · Mathematics 2007-07-09 Andrew Kresch , Joseph L. Wetherell , Michael E. Zieve

Let $p$ be a large prime, $\ell\geq 2$ be a positive integer, $m\geq 2$ be an integer relatively prime to $\ell$ and $P(x)\in\mathbb{F}_p[x]$ be a polynomial which is not a complete $\ell'$-th power for any $\ell'$ for which…

Number Theory · Mathematics 2011-10-24 Kit-Ho Mak , Alexandru Zaharescu

Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and overcoming their frequent computational difficulty is an active…

Computational Geometry · Computer Science 2024-12-18 Thekla Hamm , Fabian Klute , Irene Parada