Abstract For $$V\sim \alpha \log \log T$$ with $$0<\alpha <2$$, we prove $$\begin{align*} & \frac{1}{T}\textrm{meas}\{t\in [T,2T]: \log|\zeta(1/2+ \textrm{i} t)|>V\}\ll \frac{1}{\sqrt{\log\log T}} e^{-V^{2}/\log\log T}. \end{align*}$$This improves prior results of Soundararajan and of Harper on the large deviations of Selberg’s Central Limit Theorem in that range, without the use of the Riemann hypothesis. The result implies the sharp upper bound for the fractional moments of the Riemann zeta function proved by Heap, Radziwiłł, and Soundararajan. It also shows a new upper bound for the maximum of the zeta function on short intervals of length $$(\log T)^{\theta }$$, $$0<\theta <3$$, that is expected to be sharp for $$\theta> 0$$. Finally, it yields a sharp upper bound (to order one) for the moments on short intervals, below and above the freezing transition. The proof is an adaptation of the recursive scheme introduced by Bourgade, Radziwiłł, and one of the authors to prove fine asymptotics for the maximum on intervals of length $$1$$.
more »
« less
Poissonian Pair Correlation for $\alpha n^{\theta }$ mod 1
Abstract We show that sequences of the form $$\alpha n^{\theta } \pmod {1}$$ with $$\alpha> 0$$ and $$0 < \theta < \tfrac {43}{117} = \tfrac {1}{3} + 0.0341 \ldots $$ have Poissonian pair correlation. This improves upon the previous result by Lutsko, Sourmelidis, and Technau, where this was established for $$\alpha> 0$$ and $$0 < \theta < \tfrac {14}{41} = \tfrac {1}{3} + 0.0081 \ldots $$. We reduce the problem of establishing Poissonian pair correlation to a counting problem using a form of amplification and the Bombieri–Iwaniec double large sieve. The counting problem is then resolved non-optimally by appealing to the bounds of Robert–Sargos and (Fouvry–Iwaniec–)Cao–Zhai. The exponent $$\theta = \tfrac {2}{5}$$ is the limit of our approach.
more »
« less
- Award ID(s):
- 2404956
- PAR ID:
- 10557198
- Publisher / Repository:
- arxiv
- Date Published:
- Journal Name:
- International Mathematics Research Notices
- Volume:
- 2024
- Issue:
- 9
- ISSN:
- 1073-7928
- Page Range / eLocation ID:
- 7654 to 7679
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Let $$k_i\ (i=1,2,\ldots ,t)$$ be natural numbers with $$k_1>k_2>\cdots >k_t>0$$, $$k_1\geq 2$$ and $$t<k_1.$$ Given real numbers $$\alpha _{ji}\ (1\leq j\leq t,\ 1\leq i\leq s)$$, we consider polynomials of the shape $$\begin{align*} &\varphi_i(x)=\alpha_{1i}x^{k_1}+\alpha_{2i}x^{k_2}+\cdots+\alpha_{ti}x^{k_t},\end{align*}$$and derive upper bounds for fractional parts of polynomials in the shape $$\begin{align*} &\varphi_1(x_1)+\varphi_2(x_2)+\cdots+\varphi_s(x_s),\end{align*}$$by applying novel mean value estimates related to Vinogradov’s mean value theorem. Our results improve on earlier Theorems of Baker (2017).more » « less
-
null (Ed.)Abstract We consider the inequality $$f \geqslant f\star f$$ for real functions in $$L^1({\mathbb{R}}^d)$$ where $$f\star f$$ denotes the convolution of $$f$$ with itself. We show that all such functions $$f$$ are nonnegative, which is not the case for the same inequality in $L^p$ for any $$1 < p \leqslant 2$$, for which the convolution is defined. We also show that all solutions in $$L^1({\mathbb{R}}^d)$$ satisfy $$\int _{{\mathbb{R}}^{\textrm{d}}}f(x)\ \textrm{d}x \leqslant \tfrac 12$$. Moreover, if $$\int _{{\mathbb{R}}^{\textrm{d}}}f(x)\ \textrm{d}x = \tfrac 12$$, then $$f$$ must decay fairly slowly: $$\int _{{\mathbb{R}}^{\textrm{d}}}|x| f(x)\ \textrm{d}x = \infty $$, and this is sharp since for all $r< 1$, there are solutions with $$\int _{{\mathbb{R}}^{\textrm{d}}}f(x)\ \textrm{d}x = \tfrac 12$$ and $$\int _{{\mathbb{R}}^{\textrm{d}}}|x|^r f(x)\ \textrm{d}x <\infty $$. However, if $$\int _{{\mathbb{R}}^{\textrm{d}}}f(x)\ \textrm{d}x =: a < \tfrac 12$$, the decay at infinity can be much more rapid: we show that for all $$a<\tfrac 12$$, there are solutions such that for some $$\varepsilon>0$$, $$\int _{{\mathbb{R}}^{\textrm{d}}}e^{\varepsilon |x|}f(x)\ \textrm{d}x < \infty $$.more » « less
-
In the Correlation Clustering problem, we are given a weighted graph $$G$$ with its edges labelled as "similar" or "dissimilar" by a binary classifier. The goal is to produce a clustering that minimizes the weight of "disagreements": the sum of the weights of "similar" edges across clusters and "dissimilar" edges within clusters. We study the correlation clustering problem under the following assumption: Every "similar" edge $$e$$ has weight $$w_e \in [ \alpha w, w ]$$ and every "dissimilar" edge $$e$$ has weight $$w_e \geq \alpha w$$ (where $$\alpha \leq 1$$ and $w > 0$ is a scaling parameter). We give a $$(3 + 2 \log_e (1/\alpha))$$ approximation algorithm for this problem. This assumption captures well the scenario when classification errors are asymmetric. Additionally, we show an asymptotically matching Linear Programming integrality gap of $$\Omega(\log 1/\alpha)$$more » « less
-
AbstractWe develop a two-timing perturbation analysis to provide quantitative insights on the existence of temporal ratchets in an exemplary system of a particle moving in a tank of fluid in response to an external vibration of the tank. We consider two-mode vibrations with angular frequencies$$\omega $$ and$$\alpha \omega $$ , where$$\alpha $$ is a rational number. If$$\alpha $$ is a ratio of odd and even integers (e.g.,$$\tfrac{2}{1},\,\tfrac{3}{2},\,\tfrac{4}{3}$$ ), the system yields a net response: here, a nonzero time-average particle velocity. Our first-order perturbation solution predicts the existence of temporal ratchets for$$\alpha =2$$ . Furthermore, we demonstrate, for a reduced model, that the temporal ratcheting effect for$$\alpha =\tfrac{3}{2}$$ and$$\tfrac{4}{3}$$ appears at the third-order perturbation solution. More importantly, we find closed-form formulas for the magnitude and direction of the induced net velocities for these$$\alpha $$ values. On a broader scale, our methodology offers a new mathematical approach to study the complicated nature of temporal ratchets in physical systems. Graphic abstractmore » « less
An official website of the United States government

