Year: 2026
Type: preprint
Abstract: In this paper we consider the error term in the expected count of squarefree values of a polynomial when evaluated at integers \(n\le 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\)
Source: arXiv (Cornell University)
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7223857099