Related papers: Polynomial Differences in the Primes

Let U be a homogeneous variety over Q of a linear algebraic group. Choose an integral model and assume the existence of infinitely many integral points. Then one would like to give an asymptotic count of integral points of bounded height…

We study one-dimensional algebraic families of pairs given by a polynomial with a marked point. We prove an "unlikely intersection" statement for such pairs thereby exhibiting strong rigidity features for these pairs. We infer from this…

We prove an asymptotic formula for the number of permutation for which the associated permutation polynomial has degree smaller than $q-2$.

By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

In this paper, we exhibit an asymptotic formula for the number of representations of a large integer as a sum of a fixed power of Piatetski-Shapiro primes, thereby establishing a variant of Waring-Goldbach problem with primes from a sparse…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

Symmetry preserving difference schemes approximating second and third order ordinary differential equations are presented. They have the same three or four-dimensional symmetry groups as the original differential equations. The new…

Let $p>5$ be a fixed prime. We obtain an asymptotic formula related to small solutions of quadratic congruences of the form $x_1^2+x_2^2\equiv x_3^2\bmod{p^n}$ where $\max\{|x_1|,|x_2|,|x_3|\}\le p^{\nu n}$ with $\nu>1/2$.

We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…

We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…

Let f be an irreducible polynomial of degree d>=3 with no fixed prime divisor. We derive an asymptotic formula for the number of primes p<x such that f(p) is (d-1)-free.

We introduce a finite difference and $q$-difference analogues of the Asymptotic Iteration Method of Ciftci, Hall, and Saad. We give necessary, and sufficient condition for the existence of a polynomial solution to a general linear…

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

This paper considers a probabilistic-analytical approach to determining asymptotics of prime objects on the initial interval of the natural series. The author proposes a new method based on the construction of a probability space. An…

We prove results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$, with $\ell_1, \ell_2\in\{2,3\}$, $\ell_1+\ell_2\le 5$ are fixed…

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

We present an algorithm analogous to the sieve of Eratosthenes that produces the list of twin primes. Next, we count the number of twin primes resulting from the construction with two different heuristic arguments. The first method is…

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…

Keating and Rudnick derived asymptotic formulas for the variances of primes in arithmetic progressions and short intervals in the function field setting. Here we consider the hybrid problem of calculating the variance of primes in…