Weighted enumeration of number-fields and counting points that take bounded squarefree values along certain polynomials using Pseudo and Sudo maximal orders

Abstract

Ekedhal Sieve can be used to count squarefree bounded values of a polynomial closely related to the discriminant polynomial and one can also get a weighted lower bounds for the number of number fields with bounded discriminant which show a limsup much larger than current known bounds.