Timing analysis of targeted Hunter searches

From MaRDI portal





Generating equations for primitive algebraic number fields \(F\) of degree \(n\) and absolute discriminant \(| d_p| \) below a given bound \(\Delta\) are usually computed by a number geometric method. That method is falsely attributed to Hunter, who uses it for determining minimum discriminants in the case \(n=5\), but the idea goes at least back to Furtwängler, who did \(n=3\). The method yields bounds for the \(T_2\)-value of a root of generating polynomials and therefore for the coefficients \(a_2,\dots, a_n\) of these polynomials \(f(t)= t^n+ a_1 t^{n-1}+\cdots+ a_n\). (Note that \(a_1\in \{0,1,\dots, n-1\}\)). In this paper the authors determine the search volume for those polynomials and obtain a bound \(C_n \Delta^{(n+2)/4}\). They also give estimates for a search for generators in case \[ | d_F|= \Delta: \Biggl( \prod_{p^d\parallel\Delta} C(n,p^d)\Biggr) C_n\Delta^{(n-2)/4}. \] The constants are explicitly given for \(n\in \{4,5,6,7\}\), \(p\leq 13\), and small exponents \(d\). For the entire collection see [Zbl 0891.00022].











This page was built for publication: Timing analysis of targeted Hunter searches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840184)