An algorithm for constructing a basis of a linear system L(D) on a hyperelliptic curve is described. Algorithms by Cantor and Chebychev for computing in the Jacobian of a hyperelliptic curve are derived as special cases. The final section describes Chebychev's application of his algorithm to element
Free linear systems on integral Gorenstein curves
โ Scribed by Marc Coppens
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 527 KB
- Volume
- 145
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This author is related to the University at Leuven (Celestijnenlaan 200B B-3001 Leuven Belgium) as 2, This author represents his thanks to Katholieke Universiteit Leuven, Department Wiskunde for a Research Fellow. their kind hospitality during his stay and to the JSPS for financial support.
We find bounds for the genus of a curve over a field of characteristic p under the hypothesis that the Cartier operator of this curve has low rank and in the case where it is nilpotent. แฎ 2001 Academic Press c w x e.g., 11 . Moreover, we wish to remark that the rank of the Cartier operator on a curv