I have been gladly suprised lately by the fact that one can compute the dual of a curve in a projective space. It works quite well for me. I have tried with a curve defined over a number field without success, because the method checks if the ground field is either finite or rational. The algorithm should work on any field (at least on number fields), I do not see what is specific to that case; of course, it may be slower. I defined a function with the code of the method, taking out the restriction on the fields and it seems to work. I wonder if some restrictions on the fields should be added and if it is worth a PR (I may do it). Best, Enrique.
-- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion visit https://groups.google.com/d/msgid/sage-devel/808664bb-b8f6-4c61-91fa-cf7c5706f578n%40googlegroups.com.
