An Algorithm for Computing Weierstrass Points

F Hess

An Algorithm for Computing Weierstrass Points

F Hess

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

4 Citations (Scopus)

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 \mathbb P^1 of low degree.

Translated title of the contribution	An Algorithm for Computing Weierstrass Points
Original language	English
Title of host publication	Algorithmic Number Theory - ANTS 2002
Editors	C. Fieker, D. R. Kohel
Publisher	Springer Berlin Heidelberg
Pages	357 - 371
Number of pages	14
Volume	2369
Publication status	Published - Jul 2002

Bibliographical note

Conference Proceedings/Title of Journal: Algorithmic Number Theory ANTS 2002, LNCS 2369

Access to Document

http://www.cs.bris.ac.uk/Publications/pub_info.jsp?id=1000643

Fingerprint Dive into the research topics of 'An Algorithm for Computing Weierstrass Points'. Together they form a unique fingerprint.

Cite this

@inproceedings{43e0b9c30ee245a1a31795655fa89888,

title = "An Algorithm for Computing Weierstrass Points",

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 \mathbb P^1 of low degree. ",

author = "F Hess",

note = "Conference Proceedings/Title of Journal: Algorithmic Number Theory ANTS 2002, LNCS 2369",

year = "2002",

month = jul,

language = "English",

volume = "2369",

pages = "357 -- 371",

editor = "C. Fieker and Kohel, {D. R.}",

booktitle = "Algorithmic Number Theory - ANTS 2002",

publisher = "Springer Berlin Heidelberg",

address = "Germany",

}

TY - GEN

T1 - An Algorithm for Computing Weierstrass Points

AU - Hess, F

N1 - Conference Proceedings/Title of Journal: Algorithmic Number Theory ANTS 2002, LNCS 2369

PY - 2002/7

Y1 - 2002/7

N2 - 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 \mathbb P^1 of low degree.

AB - 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 \mathbb P^1 of low degree.

M3 - Conference Contribution (Conference Proceeding)

VL - 2369

SP - 357

EP - 371

BT - Algorithmic Number Theory - ANTS 2002

A2 - Fieker, C.

A2 - Kohel, D. R.

PB - Springer Berlin Heidelberg

ER -