๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parametrization of Algebraic Curves over Optimal Field Extensions

โœ Scribed by J.RAFAEL SENDRA; FRANZ WINKLER

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
627 KB
Volume
23
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this paper we investigate the problem of determining rational parametrizations of plane algebraic curves over an algebraic extension of least degree over the field of definition. This problem reduces to the problem of finding simple points with coordinates in the field of definition on algebraic curves of genus 0. Consequently we are also able to decide parametrizability over the reals. We generalize a classical theorem of Hilbert and Hurwitz about birational transformations. An efficient algorithm for computing such optimal parametrizations is presented.

๐Ÿ“œ SIMILAR VOLUMES

More Points Than Expected on Curves over
More Points Than Expected on Curves over Finite Field Extensions
โœ Bradley W. Brock; Andrew Granville ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 196 KB

On average, there are qP#o (qP) F qP -rational points on curves of genus g de"ned over F O P . This is also true if we restrict our average to genus g curves de"ned over F O , provided r is odd or r'2g. However, if r"2, 4, 6, 2 or 2g then the average is qP#qP#o(qP). We give a number of proofs of the

Normal Parametrizations of Algebraic Pla
Normal Parametrizations of Algebraic Plane Curves
โœ J. Rafael Sendra ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

In this paper we present a theoretical and algorithmic analysis on the normality of rational parametrizations of algebraic plane curves over arbitrary fields of characteristic zero. If the field is algebraically closed we give an algorithm to decide whether a parametrization is proper and, if not, a

Explicit Constructions of Perfect Hash F
Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields
โœ Huaxiong Wang; Chaoping Xing ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 149 KB

Let A be a set of order n and B be a set of order m. An (n, m, w)-perfect hash family is a set H of functions from A to B such that for any X A with |X |=w, there exists an element h # H such that h is one-to-one when restricted to X. Perfect hash families have many applications to computer science,