Computing in the Jacobian of a plane algebraic curve

27Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe an algorithm which extends the classical method of adjoints due to Brill and Noether for carrying out the addition operation in the Jacobian variety (represented as the divisor class group) of a plane algebraic curve defined over an algebraic number field K with arbitrary singularities. By working with conjugate sets of Puiseux expansions, we prove this method is rational in the sense that the answers it produces are defined over K. Given a curve with only ordinary multiple points and allowing precomputation of singular places, the running time of addition using this algorithm is dominated by M7 coefficient operations in a field extension of bounded degree, where M is the larger of the degree and the genus of the curve.

Cite

CITATION STYLE

APA

Volcheck, E. J. (1994). Computing in the Jacobian of a plane algebraic curve. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 877 LNCS, pp. 221–233). Springer Verlag. https://doi.org/10.1007/3-540-58691-1_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free