Squarefree Values of Random Polynomials
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
- K ab has the Bogomolov property for canonical heights
- Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions
- Wasserstein rates of all orders for the Sato-Tate law of Kloosterman sums
- Riemann functions for almost primes and their counting errors
- Topological flatness of orthogonal spin local models
- Asymptotic counting of integers with prime factors p r a s b