English
Related papers

Related papers: Computing curves on real rational surfaces

200 papers

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…

Number Theory · Mathematics 2017-08-29 Sara Checcoli , Francesco Veneziano , Evelina Viada

This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…

Number Theory · Mathematics 2007-05-23 Jonathan Pila

We survey some results on real rational surfaces focused on their topology and their birational geometry.

Algebraic Geometry · Mathematics 2025-05-26 Frederic Mangolte

In this article we give an implementation of the standard algorithm to segment a real algebraic plane curve defined implicitly. Our implementation is efficient and simpler than previous. We use global information to count the number of…

Algebraic Geometry · Mathematics 2016-05-24 Cesar Massri , Manuel Dubinsky

For affine plane curves defined over the rationals of genus at least two, we show that a decision algorithm for the existence of solutions also yields a search algorithm for all solutions.

Logic · Mathematics 2007-05-23 Minhyong Kim

We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…

Symbolic Computation · Computer Science 2011-03-25 Eric Berberich , Pavel Emeliyanenko , Alexander Kobel , Michael Sagraloff

In this paper we compute the number of rational curves with one node passing through a given number of points, lines and tangent to a given number of planes in $\mathbb{P}^3$.

Algebraic Geometry · Mathematics 2015-03-17 Dung Nguyen

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).…

alg-geom · Mathematics 2007-05-23 Z. Ran

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

Algebraic Geometry · Mathematics 2019-07-02 Momonari Kudo , Shushi Harashita

We outline a general algorithm for computing an explicit model over a number field of any curve of genus 2 whose (unpolarized) Jacobian is isomorphic to the product of two elliptic curves with CM by the same order in an imaginary quadratic…

Number Theory · Mathematics 2018-03-30 Fernando Rodriguez Villegas

We study cubic rational maps that take lines to plane curves. A complete description of such cubic rational maps concludes the classification of all planarizations, i.e., maps taking lines to plane curves.

Algebraic Geometry · Mathematics 2014-09-12 Vsevolod Petrushchenko , Vladlen Timorin

We obtain a formula for the degrees of the varieties parameterizing complex algebraic curves of any divisor class and genus on P^2_6, the projective plane blown-up at 6 generic points. Moreover, the formula computes the degrees of the…

Algebraic Geometry · Mathematics 2012-02-28 M. Shoval , E. Shustin

We give an algorithm for calculating the splitting type of the normal bundle of any rational monomial curve. The algorithm is obtained by reducing the calculus to a combinatorial problem and then by solving this problem.

Algebraic Geometry · Mathematics 2015-12-23 Alberto Alzati , Riccardo Re , Alfonso Tortora

We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…

Computational Geometry · Computer Science 2024-07-26 Michael Burr , Michael Byrd

We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…

Computational Geometry · Computer Science 2024-07-29 Michael Burr , Michael Byrd

In previous work we determined automorphism groups of cyclic algebraic curves defined over fields of any odd characteristic. In this paper we determine parametric equations of families of curves for each automorphism group for such curves.

Algebraic Geometry · Mathematics 2013-01-22 R. Sanjeewa , T. Shaska

We describe the topology of singular real algebraic curves in a smooth surface. We enumerate and bound in terms of the degree the number of topological types of singular algebraic curves in the real projective plane.

Algebraic Geometry · Mathematics 2026-01-14 Christopher-Lloyd Simon

We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of…

Algebraic Geometry · Mathematics 2019-04-24 Emre Can Sertöz

We consider flat families of reduced curves on a smooth surface S such that each member C has the same number of singularities of fixed singularity types and the corresponding (locally closed) subscheme H of the Hilbert scheme of S. We are…

alg-geom · Mathematics 2008-02-03 Gert-Martin Greuel , Christoph Lossen

We proved the existence of rational curves in every linear system on a general K3 surface and that all rational curves in the hyperplane class are nodal on a general K3 surface of small genus.

Algebraic Geometry · Mathematics 2007-05-23 Xi Chen
‹ Prev 1 3 4 5 6 7 10 Next ›