Implementation of prime decomposition of polynomial ideals over small finite fields

AbstractAn algorithm for the prime decomposition of polynomial ideals over small finite fields is proposed and implemented on the basis of previous work of the second author. To achieve better performance, several improvements are added to the existing algorithm, with strategies for computational flow proposed, based on experimental results. The practicality of the algorithm is examined by testing the implementation experimentally, which also reveals information about the quality of the implementation

Implementation of prime decomposition of polynomial ideals over small finite fields

AbstractAn algorithm for the prime decomposition of polynomial ideals over small finite fields is proposed and implemented on the basis of previous work of the second author. To achieve better performance, several improvements are added to the existing algorithm, with strategies for computational flow proposed, based on experimental results. The practicality of the algorithm is examined by testing the implementation experimentally, which also reveals information about the quality of the implementation

Computing canonical heights using arithmetic intersection theory

For several applications in the arithmetic of abelian varieties it is important to compute canonical heights. Following Faltings and Hriljac, we show how the canonical height on the Jacobian of a smooth projective curve can be computed using arithmetic intersection theory on a regular model of the curve in practice. In the case of hyperelliptic curves we present a complete algorithm that has been implemented in Magma. Several examples are computed and the behavior of the running time is discussed.Comment: 29 pages. Fixed typos and minor errors, restructured some sections. Added new Example