Timing analysis of targeted hunter searches
- First Online:
One can determine all primitive number fields of a given degree and discriminant with a finite search of potential defining polynomials. We develop an asymptotic formula for the number of polynomials which need to be inspected which reflects both archimedean and non-archimedean restrictions placed on the coefficients of a defining polynomial.
Unable to display preview. Download preview PDF.
- [C1]Cohen, H.: A Course in Computational Algebraic Number Theory, GTM 138 Springer Verlag, 1995.Google Scholar
- [CS1]Conway, J. and Sloane, N.: Sphere Packings, Lattices, and Groups, Springer Verlag, 1988.Google Scholar
- [D1]Denef, J.: Report on Igusa's local zeta function, Séminaire Bourbaki 741, Astérisque 201–202–203, 359–386.Google Scholar
- [J1]Jones, J.: Tables of number fields with prescribed ramification, a WWW site, http://math.la.asu.edu/~jj/numberfieldsGoogle Scholar
- [JR1]Jones, J. and Roberts, D.: Sextic number fields with discriminant − j 2 a 3 b, to appeal in the Proceedings of the Fifth Conference of the Canadian Number Theory Association.Google Scholar
- [M1]Mehta, M.: Random Matrices, 2nd edition, Academic Press, 1991.Google Scholar
- [R1]Roberts, D.: Twin sextic algebras, to appear in Rocky Mountain J. Math.Google Scholar
- [R2]Roberts, D.: Low degree p-adic fields, in preparation.Google Scholar