Density of power-free values of polynomials

Abstract

We establish asymptotic formulae for the number of $k$-free values of polynmilas $F(x_1,\cdots ,x_n)\in \mathbb{Z}[x_1,\cdots ,x_n]$ of degree $d\ge 2$ for any $n\ge 1$, including when the variables are prime, as long as $k\ge (3d+1)/4$. Thus we generalize a work of Browning, while we use a different sieveing technique for the middle range of primes.

arXiv comment12 pages, comments welcome

References in corpus (7)

• Squarefree values of multivariable polynomials
• The geometric sieve and the density of squarefree values of invariant polynomials
• Squarefree values of polynomial discriminants I
• Power-free values of binary forms and the global determinant method
• Density of power-free values of polynomials
• Square-free values of decomposable forms
• Power-free values of the polynomial t_1...t_r - 1

Cited by in corpus (2)

• Density of power-free values of polynomials
• A stratification result for an exponential sum modulo $p^2$