#18916: Use Kedlaya algorithm to count points on hyperelliptic curves
---------------------------------+------------------------
Reporter: jpflori | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.8
Component: number fields | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------+------------------------
Comment (by jpflori):
The magic line reads something like:
{{{
monsky_washnitzer.matrix_of_frobenius_hyperelliptic(self.hyperelliptic_polynomials()[0],
p, prec)[0]
}}}
The defining polynomial needs to be monicified which is also required by
hypellfrob, so it makes sense to refactor the code a little bit.
And it only works for prime fields.
There is also a PARI/GP implem without these restriction (only p != 2 I'd
say)
--
Ticket URL: <http://trac.sagemath.org/ticket/18916#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
