Related papers: The Fyodorov-Hiary-Keating Conjecture. I

In the paper the well known Riemann Hypothesis is proven. The proof is based on uniform approximation of the zeta function discs of the critical strip placed to the right from the critical line.The basic moment is a use of a new mesure…

We compute the leading asymptotics as $N\to\infty$ of the maximum of the field $Q_N(q)= \log\det|q- A_N|$, $q\in \mathbb{C}$, for any unitarily invariant Hermitian random matrix $A_N$ associated to a non-critical real-analytic potential.…

A well-known conjecture, often attributed to Ryser, states that the cover number of an $r$-partite $r$-uniform hypergraph is at most $r - 1$ times larger than its matching number. Despite considerable effort, particularly in the…

These notes were written for the mini-course "Extrema of log-correlated random variables: Principles and Examples" at the Introductory School held in January 2015 at the Centre International de Rencontres Math\'ematiques in Marseille. There…

Let $\Theta$ denote the supremum of the real parts of the zeros of the Riemann zeta function. We demonstrate that $\Theta=1$, which entails the existence of infinitely many Riemann zeros off the critical line (thus disproving the Riemann…

We prove that for any fixed real numbers y_1, y_2 not equal to 0, and constant C > 0, there exists a threshold T_* = T_*(y_1, y_2, C) > 0 such that for all T >= T_*, the interval [T, T(1 + epsilon)], with epsilon = exp(-C sqrt(log T)),…

In a spirit of Ap\'ery's proof of the irrationality of $\zeta(3)$, we construct a sequence $p_n/q_n$ of rational approximations to the $2$-adic zeta value $\zeta_2(5)$ which satisfy $0 < |\zeta_2(5)-p_n/q_n|_2 <…

We consider a problem introduced by Feige, Gamarnik, Neeman, R\'acz and Tetali [2020], that of finding a large clique in a random graph $G\sim G(n,\frac{1}{2})$, where the graph $G$ is accessible by queries to entries of its adjacency…

In this paper, we prove the lower bound of the unconditional large gap is 3.5555 which improves the obtained value 3.079 in the literature. Next, on the hypothesis that the moments of the Hardy Z-function and its derivatives are correctly…

Consider finite sequences $X_{[1,n]}=X_1\dots X_n$ and $Y_{[1,n]}=Y_1\dots Y_n$ of length $n$, consisting of i.i.d.\ samples of random letters from a finite alphabet, and let $S$ and $T$ be chosen i.i.d.\ randomly from the unit ball in the…

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and $E(T)$ the error term in the asymptotic formula for the mean square of $|\zeta(1/2 + it)|$. If $E^*(t) = E(t) - 2\pi\Delta^*(t/(2\pi))$ with $\Delta^*(x) = -…

We prove precise conditional estimates for the third moment of the logarithm of the Riemann zeta function, refining what is implied by the Selberg central limit theorem, both for the real and imaginary parts. These estimates match…

We give a new upper bound on the Selberg zeta function for a convex co-compact Schottky group acting on $ {\mathbb H}^{n+1}$: in strips parallel to the imaginary axis the zeta function is bounded by $ \exp (C |s|^\delta) $ where $ \delta $…

We establish in this paper sharp lower bounds for the $2k$-th moment of the derivative of the Riemann zeta function on the critical line for all real $k \geq 0$.

We obtain optimal lower bounds for moments of theta functions. On the other hand, we also get new upper bounds on individual theta values and moments of theta functions on average over primes. The upper bounds are based on bounds of…

For any fixed simple graph $H=(V,E)$ and any fixed $u>0$, we establish the leading order of the exponential rate function for the probability that the number of copies of $H$ in the Erd\H{o}s--R\'enyi graph $G(n,p)$ exceeds its expectation…

Under the Riemann Hypothesis, we connect the distribution of $k$-free numbers with the derivative of the Riemann zeta-function at nontrivial zeros of $\zeta(s)$. Moreover, with additional assumptions, we prove the existence of a limiting…

We consider the problem of sketching the $p$-th frequency moment of a vector, $p>2$, with multiplicative error at most $1\pm \epsilon$ and \emph{with high confidence} $1-\delta$. Despite the long sequence of work on this problem, tight…

We consider the combinatorial Laplacian on a sequence of discrete tori which approximate the m-dimensional torus. In the special case m=1, Friedli and Karlsson derived an asymptotic expansion of the corresponding spectral zeta function in…

The theta function of Lovasz is a graph parameter that can be computed up to arbitrary precision in polynomial time. It plays a key role in algorithms that approximate graph parameters such as maximum independent set, maximum clique and…