相关论文: A sum-product estimate in fields of prime order

In this note we prove an inequality involving primes and the product of consecutive primes.

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given $E\subset \mathbb…

We show that for every $0 < \epsilon \leq 1$ and integer $k\geq 1$, there exists an integer $n = n(\epsilon,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^\epsilon$ such…

We combine our version of the resonance method with certain convolution formulas for $\zeta(s)$ and $\log\, \zeta(s)$. This leads to a new $\Omega$ result for $|\zeta(1/2+it)|$: The maximum of $|\zeta(1/2+it)|$ on the interval $1 \le t \le…

Let ${\Bbb F}_2$ be the finite field of two elements, ${\Bbb F}_2^n$ be the vector space of dimension $n$ over ${\Bbb F}_2$. For sets $A,\,B\subseteq{\Bbb F}_2^n$, their sumset is defined as the set of all pairwise sums $a+b$ with $a\in…

For every positive integer N and every $\alpha\in [0,1)$, let $B(N, \alpha)$ denote the probabilistic model in which a random set $A\subset \{1,\dots,N\}$ is constructed by choosing independently every element of $\{1,\dots,N\}$ with…

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…

In this paper, we analyze the sum of squares hierarchy (SOS) on the ordering principle on $n$ elements. We prove that degree $O(\sqrt{n}log(n))$ SOS can prove the ordering principle. We then show that this upper bound is essentially tight…

A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if…

In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

Let $\mathbb{F}_q$ be a finite field of order $q$, where $q$ is large odd prime power. In this paper, we improve some recent results on the additive energy of the distance set, and on sumsets of the distance set due to Shparlinski (2016).…

We investigate the extreme values of the Riemann zeta function $\zeta(s)$. On the 1-line, we obtain a lower bound evaluation $$\max_{t\in[1,T]}|\zeta(1+\i t)|\ge {\rm e}^\gamma(\log_2T+\log_3T+c),$$ with an effective constant $c$ which…

For any prime p we consider the density of elements in the multiplicative group of the finite field F_p having order, respectively index, congruent to a(mod d). We compute these densities on average, where the average is taken over all…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-\epsilon}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and…

Let $d\geq 2$, $A \subset \mathbb{Z}^d$ be finite and not contained in a translate of any hyperplane, and $q \in \mathbb{Z}$ such that $|q| > 1$. We show $$|A+ q \cdot A| \geq (|q|+d+1)|A| - O_{q,d}(1).$$