Searcharxiv⌕ Search

arXiv subjects

Kostadinka Lapkova

Publications and source records attributed to Kostadinka Lapkova.

9 recordsLinked to original sources

Density of power-free values of polynomials II

In this paper we prove that polynomials $F(x_1, \cdots, x_n) \in \mathbb{Z}[x_1, \cdots, x_n]$ of degree $d \geq 3$, satisfying certain hypotheses, take on the expected density of $(d-1)$-free values. This extends the authors' earlier result where a different method implied the similar statement for polynomials of degree $d\geq 5$.

math.NT↗

A stratification result for an exponential sum modulo $p^2$

In this note we consider algebraic exponential sums over the values of homogeneous nonsingular polynomials $F(x_1, \cdots, x_n) \in \mathbb{Z}[x_1, \cdots, x_n]$ in the quotient ring $\mathbb{Z}/p^2\mathbb{Z}$. We provide an estimate of this exponential sum and a corresponding stratification of the space $\mathbb{A}_{\mathbb{F}_p}^n$, which in particular illustrates a general stratification theorem of Fouvry and Katz.

math.NT↗

On the average sum of the $k$-th divisor function over values of quadratic polynomials

Let $F({\bf x})\in\mathbb{Z}[x_1,x_2,\dots,x_n]$ be a quadratic polynomial in $n\geq 3$ variables with a nonsingular quadratic part. Using the circle method we derive an asymptotic formula for the sum $$ Σ_{k,F}(X; {\mathcal{B}})=\sum_{{\bf x}\in X\mathcal{B}\cap\mathbb{Z}^{n}}τ_{k}\left(F({\bf x})\right), $$ for $X$ tending to infinity, where $\mathcal{B}\subset\mathbb{R}^n$ is an $n$-dimensional box such that $\min\limits_{{\bf x}\in X\mathcal{B}}F({\bf x})\ge 0$ for all sufficiently large $X$, and $τ_{k}(\cdot)$ is the $k$-th divisor function for any integer $k\ge 2$.

math.NT↗

Density of power-free values of polynomials

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\geq 2$ for any $n\geq 1$, including when the variables are prime, as long as $k\geq (3d+1)/4$. Thus we generalize a work of Browning, while we use a different sieveing technique for the middle range of primes.

math.NT↗

On the average number of divisors of reducible quadratic polynomials

We give an asymptotic formula for the divisor sum $\sum_{c<n\leq N}τ\left((n-b)(n-c)\right)$ for integers $b<c$ of the same parity. Interestingly, the coefficient of the main term does not depend on the discriminant as long as it is a full square. We also provide effective upper bounds of the average divisor sum for some of the reducible quadratic polynomials considered before, with the same main term as in the asymptotic formula.

math.NT↗

On the $k$-free values of the polynomial $xy^k+C$

Consider the polynomial $f(x,y)=xy^k+C$ for $k\geq 2$ and any nonzero integer constant $C$. We derive an asymptotic formula for the $k$-free values of $f(x,y)$ when $x, y\leq H$. We also prove a similar result for the $k$-free values of $f(p,q)$ when $p,q\leq H$ are primes. The strongest tool we use is a recent generalization of the determinant method due to Reuss.

math.NT↗