Related papers: Fourier optimization and consequences of the gener…
We investigate some extremal problems in Fourier analysis and their connection to a problem in prime number theory. In particular, we improve the current bounds for the largest possible gap between consecutive primes assuming the Riemann…
By means of a Fourier optimization framework, we improve the current asymptotic bounds under GRH for two classical problems in number theory: the problem of estimating the least quadratic non-residue modulo a prime, and the problem of…
Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math.…
We introduce a generic framework to provide bounds related to the pair correlation of sequences belonging to a wide class. We consider analogues of Montgomery's form factor for zeros of the Riemann zeta function in the case of arbitrary…
We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.
Assuming the Riemann hypothesis, we improve the current upper and lower bounds for the average value of Montgomery's function $F(\alpha, T)$ over long intervals by means of a Fourier optimization framework. The function $F(\alpha, T)$ is…
The non-trivial zeros of the Riemann zeta function and the prime numbers can be plotted by a modified von Mangoldt function. The series of non-trivial zeta zeros and prime numbers can be given explicitly by superposition of harmonic waves.…
We prove several results about integers represented by positive definite quadratic forms, using a Fourier analysis approach. In particular, for an integer $\ell\geq 1$, we improve the error term in the partial sums of the number of…
We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…
Numerical continuation in the context of optimization can be used to mitigate convergence issues due to a poor initial guess. In this work, we extend this idea to Riemannian optimization problems, that is, the minimization of a target…
We prove that the error in the prime number theorem can be quantitatively improved beyond the Riemann Hypothesis bound by using versions of Montgomery's conjecture for the pair correlation of zeros of the Riemann zeta-function which are…
In this article, we study the Euler's factorial series $F_p(t)=\sum_{n=0}^\infty n!t^n$ in $p$-adic domain under the Generalized Riemann Hypothesis. First, we show that if we consider primes in $k\varphi(m)/(k+1)$ residue classes in the…
This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…
In this paper, we obtain under the assumption of the Generalized Riemann Hypothesis upper bounds for all high integral moments of sums of Fourier coefficients of a given modular form twisted by quadratic Dirichlet characters. We show the…
From Bombieri's mean value theorem one can deduce the prime number theorem being equivalent to the Riemann hypothesis and the least prime P(q) satisfying P(q)= O(q^2 [ln q]^32) in any arithmetic progressions with common difference q.
We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…
This paper exploits a basic connection between sequential quadratic programming and Riemannian gradient optimization to address the general question of selecting a metric in Riemannian optimization, in particular when the Riemannian…
On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.
One field of particular interest in Number Theory concerns the gaps between consecutive primes. Within the last few years, very important results have been achieved on how small these gaps can be. The strongest of these results were…
Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…