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
Variety of linear systems on double covering curves
โ Scribed by Edoardo Ballico; Changho Keem
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 746 KB
- Volume
- 128
- Category
- Article
- ISSN
- 0022-4049
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract The goal of this paper is to give a method to compute the space of infinitesimal deformations of a double cover of a smooth algebraic variety. The space of all infinitesimal deformations has a representation as a direct sum of two subspaces. One is isomorphic to the space of simultaneou
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.