Squarefree Values of Random Polynomials

arXiv:2610.33628 · math.NT · Submitted 2026-10-24 · Read on arXiv

math.NT

Submitted: 2026-10-24

Updated: 2026-10-24

Comments: 14 pages

License: http://creativecommons.org/licenses/by-nc-nd/4.0/

The gist: In this paper we consider the error term in the expected count of squarefree values of a polynomial when evaluated at integers n at most N.

Abstract

In this paper we consider the error term in the expected count of squarefree values of a polynomial when evaluated at integers n at most N. We prove a power saving on average over polynomials of fixed degree and height at most H. Our results improve previous estimates of Browning and Shparlinski in that the required range of H is independent of the degree, but depends on N

Related papers