Searcharxiv⌕ Search

arXiv subjects

Andrés Chirre

Publications and source records attributed to Andrés Chirre.

25 records · Page 2Linked to original sources

Primes in arithmetic progressions and semidefinite programming

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. Helv. 94, no. 3 (2019)]. For this we extend the Guinand-Weil explicit formula over all Dirichlet characters modulo $q \geq 3$, and we reduce the associated extremal problems to convex optimization problems that can be solved numerically via semidefinite programming.

math.NT↗

A note on the zeros of approximations of the Ramanujan $Ξ-$function

In this paper, we review the study of the distribution of the zeros of certain approximations for the Ramanujan $Ξ-$function given by Haseo Ki, and we provide a new proof of his results. Our approach is motivated by the ideas of Velásquez in the study of the zeros of certain sums of entire functions with some condition of stability related to the Hermite-Biehler theorem.

math.NT↗

Pair Correlation Estimates for the Zeros of the Zeta Function via Semidefinite Programming

In this paper we study the distribution of the non-trivial zeros of the Riemann zeta-function $ζ(s)$ (and other L-functions) using Montgomery's pair correlation approach. We use semidefinite programming to improve upon numerous asymptotic bounds in the theory of $ζ(s)$, including the proportion of distinct zeros, counts of small gaps between zeros, and sums involving multiplicities of zeros.

math.NT↗

Extreme values for $S_n(σ,t)$ near the critical line

Let $S(σ,t)=\frac{1}π\argζ(σ+it)$ be the argument of the Riemann zeta function at the point $σ+it$ of the critical strip. For $n\geq 1$ and $t>0$ we define $$ S_{n}(σ,t) = \int_0^t S_{n-1}(σ,τ)\,dτ\, + δ_{n,σ\,}, $$ where $δ_{n,σ}$ is a specific constant depending on $σ$ and $n$. Let $0\leq β<1$ be a fixed real number. Assuming the Riemann hypothesis, we show lower bounds for the maximum of the function $S_n(σ,t)$ on the interval $T^β\leq t \leq T$ and near to the critical line, when $n\equiv 1\mod 4$. Similar estimates are obtained for $|S_n(σ,t)|$ when $n\not\equiv 1\mod 4$. This extends a recently results of Bondarenko and Seip for a region near the critical line. In particular we obtain some omega results for these functions on the critical line.

math.NT↗

A note on entire $L$-functions

In this paper, we exhibit upper and lower bounds with explicit constants for some objects related to entire $L$-functions in the critical strip, under the generalized Riemann hypothesis. The examples include the entire Dirichlet $L$-functions $L(s,χ)$ for primitive characters $χ$.

math.NT↗

Bandlimited approximations and estimates for the Riemann zeta-function

In this paper, we provide explicit upper and lower bounds for the argument of the Riemann zeta-function and its antiderivatives in the critical strip under the assumption of the Riemann hypothesis. This extends the previously known bounds for these quantities on the critical line (and sharpens the error terms in such estimates). Our tools come not only from number theory, but also from Fourier analysis and approximation theory. An important element in our strategy is the ability to solve a Fourier optimization problem with constraints, namely, the problem of majorizing certain real-valued even functions by bandlimited functions, optimizing the $L^1(\mathbb{R})-$error. Deriving explicit formulae for the Fourier transforms of such optimal approximations plays a crucial role in our approach.

math.NT↗

Bounding $S_n(t)$ on the Riemann hypothesis

Let $S(t) = \tfrac{1}π \arg ζ(\frac12 + it)$ be the argument of the Riemann zeta-function at the point $\tfrac12 + it$. For $n \geq 1$ and $t>0$ define its iterates \begin{equation*} S_n(t) = \int_0^t S_{n-1}(τ) \,{\rm d}τ\, + δ_n\,, \end{equation*} where $δ_n$ is a specific constant depending on $n$ and $S_0(t) := S(t)$. In 1924, J. E. Littlewood proved, under the Riemann hypothesis (RH), that $S_n(t) = O(\log t/ (\log \log t)^{n+1})$. The order of magnitude of this estimate was never improved up to this date. The best bounds for $S(t)$ and $S_1(t)$ are currently due to Carneiro, Chandee and Milinovich. In this paper we establish, under RH, an explicit form of this estimate \begin{equation*} -\left( C^-_n + o(1)\right) \frac{\log t}{(\log \log t)^{n+1}} \ \leq \ S_n(t) \ \leq \ \left( C^+_n + o(1)\right) \frac{\log t}{(\log \log t)^{n+1}}\,, \end{equation*} for all $n\geq 2$, with the constants $C_n^{\pm}$ decaying exponentially fast as $n \to \infty$. This improves (for all $n \geq 2$) a result of Wakasa, who had previously obtained such bounds with constants tending to a stationary value when $n \to \infty$. Our method uses special extremal functions of exponential type derived from the Gaussian subordination framework of Carneiro, Littmann and Vaaler for the cases when $n$ is odd, and an optimized interpolation argument for the cases when $n$ is even. In the final section we extend these results to a general class of $L$-functions.

math.NT↗