The quadratic resolvent counting conjecture

About 10 years old · traced to

Let FF be a quadratic field, and let QRn(X,F)QR_n(X,F) be the set of SnS_n-fields whose common quadratic resolvent is FF and whose absolute discriminant is bounded by XX. Let dFd_F denote the discriminant of FF.

Quadratic resolvent counting conjecture. There is a constant βn\beta_n with 0<βn<1/20<\beta_n<1/2 such that

∣QRn(X,F)∣≪(X∣dF∣)1−βn,|QR_n(X,F)|\ll\left(\frac{X}{|d_F|}\right)^{1-\beta_n},

where the implied constant is independent of FF.

The conjecture is a weaker form of the expected bound for fields sharing a quadratic resolvent and is used in the paper to obtain results on the smallest prime in a conjugacy class. Its status is not resolved in the supplied text.

References

Primary source

Peter J. Cho and Henry H. Kim, “The average of the smallest prime in a conjugacy class”, arXiv:1601.03012 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.