Approximating Euler products and class number computation in algebraic function fields (Q613542): Difference between revisions

The zeta function of an algebraic number field encodes information about the divisor class group of the field through its value at one. By approximating the Euler product representation of the zeta function to sufficient accuracy, one can compute the class number either directly or via a combination with algebraic methods such as baby-step giant-step. This technique has been used successfully in the case of quadratic function fields \textit{A. Stein} and \textit{E. Teske} [``Explicit bounds and heuristics on class numbers in hyperelliptic function fields,'' Math. Comput. 71, No. 239, 837--861 (2002; Zbl 0992.11068)] and earlier in algebraic number fields \textit{J. Buchmann} and \textit{H. C. Williams} [``On the computation of the class number of an algebraic number field,'' Math. Comput. 53, No. 188, 679--688 (1989; Zbl 0677.12003)]. In this paper, the authors extend this technique to arbitrary algebraic function fields. Three different approximation algorithms are presented; all require roughly the same computational effort, but yield slightly different approximations and error estimates. Discussions of how the methods could be applied to class number computation and investigating the distribution of zeros of the zeta function are included.