SearcharxivSearch

arXiv subjects

S. I. Dimitrov

Publications and source records attributed to S. I. Dimitrov.

At least 19 recordsLinked to original sources

A Diophantine inequality involving different powers of primes of the form $[n^c]$

Let $[\, x\,]$ denote the integer part of a real number $x$. Assume that $λ_1,λ_2,λ_3$ are nonzero real numbers, not all of the same sign, that $λ_1/λ_2$ is irrational, and that $η$ is real. Let $\frac{219}{220}<γ<1$ and $θ>0$. We establish that, there exist infinitely many triples of primes $p_1,\, p_2,\, p_3$ satisfying the inequality \begin{equation*} |λ_1p_1 + λ_2p_2 + λ_3p^4_3+η|<\big(\max \{p_1, p_2, p^4_3\}\big)^{\frac{219-220γ}{208}+θ} \end{equation*} and such that $p_i=[n_i^{1/γ}]$, $i=1,\,2,\,3$.

math.NT

Diophantine approximation with mixed powers of Piatetski-Shapiro primes

Let $[\,\cdot\,]$ denote the floor function. In this paper, we show that whenever $η$ is real and the constants $λ_i$ satisfy some necessary conditions, then for any fixed $\frac{63}{64}<γ<1$ and $θ>0$, there exist infinitely many prime triples $p_1,\, p_2,\, p_3$ satisfying the inequality \begin{equation*} |λ_1p_1 + λ_2p_2 + λ_3p^2_3+η|<\big(\max \{p_1, p_2, p^2_3\}\big)^{{\frac{63-64γ}{52}}+θ} \end{equation*} and such that $p_i=[n_i^{1/γ}]$, $i=1,\,2,\,3$.

math.NT

A Diophantine inequality with five squares of Piatetski-Shapiro primes

Let $[\,\cdot\,]$ denote the floor function. Assume that $λ_1, λ_2, λ_3, λ_4, λ_5$ are nonzero real numbers, not all of the same sign, that $λ_1/λ_2$ is irrational, and that $η$ is a real number. Let $\frac{71}{72}<γ<1$ and $θ>0$. We prove that there exist infinitely many quintuples of primes $p_1,\, p_2,\, p_3,\, p_4,\, p_5$ satisfying the Diophantine inequality \begin{equation*} \big|λ_1p^2_1 + λ_2p^2_2 + λ_3p^2_3+ λ_4p^2_4 + λ_5p^2_5+η\big|<\big(\max p_j\big)^{\frac{71-72γ}{29}+θ}\,, \end{equation*} where $p_i=[n_i^{1/γ}]$, $i=1,\,2,\,3,\,4,\,5$. We also prove analogous theorems by raising the last variable in the inequality to the third and fourth powers.

math.NT

A binary additive equation with prime and square-free number

Let $[\, \cdot\,]$ be the floor function. In this paper, we show that when $1<c<\frac{82}{79}$, then every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p^c]+[m^c]\,, \end{equation*} where $p$ is a prime and $m$ is a square-free.

math.NT

On the distribution of $αp^2$ modulo one over primes of the form $[n^c]$

Let $[\, \cdot\,]$ be the floor function and $\|x\|$ denote the distance from $x$ to the nearest integer. In this paper we show that whenever $α$ is irrational and $β$ is real then for any fixed $\frac{13}{14}<γ<1$, there exist infinitely many prime numbers $p$ satisfying the inequality \begin{equation*} \|αp^2+β\|< p^{\frac{13-14γ}{29}+\varepsilon} \end{equation*} and such that $p=[n^{1/γ}]$.

math.NT

On the distribution of $αp$ modulo one over Piatetski-Shapiro primes

Let $[\, \cdot\,]$ be the floor function and $\|x\|$ denotes the distance from $x$ to the nearest integer. In this paper we show that whenever $α$ is irrational and $β$ is real then for any fixed $1<c<12/11$ there exist infinitely many prime numbers $p$ satisfying the inequality \begin{equation*} \|αp+β\|\ll p^{\frac{11c-12}{26c}}\log^6p \end{equation*} and such that $p=[n^c]$.

math.NT

A ternary diophantine inequality by primes with one of the form $\mathbf{p=x^2+y^2+1}$

In this paper we solve the ternary Piatetski-Shapiro inequality with prime numbers of a special form. More precisely we show that, for any fixed $1 0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c-N|<\varepsilon \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3$, such that $p_1=x^2 + y^2 +1$. For this purpose we establish a new Bombieri -- Vinogradov type result for exponential sums over primes.

math.NT

On an equation by primes with one Linnik prime

Let $[\, \cdot\,]$ be the floor function. In this paper, we prove that when $1<c<\frac{16559}{15276}$, then every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p^c_1]+[p^c_2]+[p^c_3]\,, \end{equation*} where $p_1,p_2,p_3$ are primes, such that $p_1=x^2 + y^2 +1$.

math.NT