2,152 research outputs found
Computing in Jacobians of projective curves over finite fields
We give algorithms for computing with divisors on projective curves over
finite fields, and with their Jacobians, using the algorithmic representation
of projective curves developed by Khuri-Makdisi. We show that many desirable
operations can be done efficiently in this setting: decomposing divisors into
prime divisors; computing pull-backs and push-forwards of divisors under finite
morphisms, and hence Picard and Albanese maps on Jacobians; generating
uniformly random divisors and points on Jacobians; computing Frobenius maps and
Kummer maps; and finding a basis for the -torsion of the Picard group, where
is a prime number different from the characteristic of the base field.Comment: 42 page
Linearizing torsion classes in the Picard group of algebraic curves over finite fields
We address the problem of computing in the group of -torsion rational
points of the jacobian variety of algebraic curves over finite fields, with a
view toward computing modular representations.Comment: To appear in Journal of Algebr
- …