An Algorithm for Computing Weierstrass Points

Authors:
Florian Hess
Affiliations:
-
Venue:
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Year:
2002

Citing 6
Cited 2

An algorithm for computing the Weierstrass normal form

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Rational parametrizations of algebraic curves using a canonical divisor

Journal of Symbolic Computation - Special issue: parametric algebraic curves and applications
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Computing Riemann---Roch spaces in algebraic function fields and related topics

Journal of Symbolic Computation
Efficient solution of rational conics

Mathematics of Computation
Algebraic Function Fields and Codes

Algebraic Function Fields and Codes

Classification of genus 3 curves in special strata of the moduli space

ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Halving for the 2-Sylow subgroup of genus 2 curves over binary fields

Finite Fields and Their Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We develop algorithms for computing differentiations and Weierstrass points of algebraic curves in any characteristic. As an application we explain how this can be used to compute special models of curves together with a map to P1 of low degree.