Related papers: Explicit bounds for primes in arithmetic progressi…

Assuming the Generalized Riemann Hypothesis, we establish explicit bounds in the $q$-aspect for the logarithmic derivative $\left(L'/L\right)\left(\sigma,\chi\right)$ of Dirichlet $L$-functions, where $\chi$ is a primitive character modulo…

In this paper we give simple proofs for the bounds (some of them sharp) of the difference of the moduli of the second and the first logarithmic coefficient for the general class of univalent functions and for the class of convex univalent…

In this paper we present some new results about unlike powers in arithmetic progression. We prove among other things that for given $k\geq 4$ and $L\geq 3$ there are only finitely many arithmetic progressions of the form…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

In his 1979 paper Samuel Wagstaff studied the problem of bounding the first prime in an arithmetic progression. In this paper we update a number of his computations using advances in hardware. Based on this we refine his conjecture on…

Given a non-principal Dirichlet character chi mod q, an important problem in number theory is to obtain good estimates for the size of L(1,chi). In this paper we focus on sharpening the upper bounds known for |L(1,chi)|; in particular, we…

In this paper we establish explicit upper and lower bounds for the ratio of the arithmetic and geometric means of the prime numbers, which improve the current best estimates. Further, we prove several conjectures related to this ration…

The aim of this paper is to improve the upper bound for the exceptional zeroes $\beta_0$ of Dirichlet $L$-functions. We do this by improving on explicit estimate for $L'(\sigma, \chi)$ for $\sigma$ close to unity.

In this article, we provide explicit bounds for the prime counting function $\theta(x)$ in all ranges of $x$. The bounds for the error term for $\theta (x)- x$ are of the shape $\epsilon x$ and $\frac{c_k x}{(\log x)^k}$, for…

We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…

On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.

In this paper, we provide tight lower bounds for the oracle complexity of minimizing high-order H\"older smooth and uniformly convex functions. Specifically, for a function whose $p^{th}$-order derivatives are H\"older continuous with…

Assuming the generalized Riemann hypothesis, we evaluate sharp upper bounds for the shifted moments of quadratic Dirichlet L-functions with moduli 8p, where p ranges over odd primes. We then apply this result to prove bounds for the moments…

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Let $q$ be a sufficiently large integer, and $a_0\in\{0,\dots,q-1\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their base $q$ expansion. Similar results are obtained for values of a polynomial…

For $q,n,d \in \mathbb{N}$, let $A_q^L(n,d)$ denote the maximum cardinality of a code $C \subseteq \mathbb{Z}_q^n$ with minimum Lee distance at least $d$, where $\mathbb{Z}_q$ denotes the cyclic group of order $q$. We consider a…

We study arithmetic functions $\Phi(x;d,a)$, called prime running functions, whose value at $x$ sums the gaps between primes $p_k \equiv a\ (\text{mod}\ d)$ below $x$ and the next following prime $p_{k+1}$, up to $x$. (The following prime…

We show that substantially more than a quarter of the odd integers of the form $pq$ up to $x$, with $p,q$ both prime, satisfy $p\equiv q\equiv 3 \pmod 4$.

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$, extending the Bombieri-Vinogradov theorem to moduli of size $x^{1/2+\delta}$ which have conveniently sized divisors. The main feature of…