English
Related papers

Related papers: Upper bound for the counting function of interior …

200 papers

The threshold behaviour of negative eigenvalues for Schr\"{o}dinger operators of the type $$ H_\lambda=-\frac{d^2}{dx^2}+U(x)+\lambda\alpha_\lambda V(\alpha_\lambda x) $$ is considered. The potentials $U$ and $V$ are real-valued bounded…

Spectral Theory · Mathematics 2021-12-14 Yuriy Golovaty

It is known that $|\zeta(1+ it)|\ll (\log t)^{2/3}$. This paper provides a new explicit estimate, viz.\ $|\zeta(1+ it)|\leq 3/4 \log t$, for $t\geq 3$. This gives the best upper bound on $|\zeta(1+ it)|$ for $t\leq 10^{2\cdot 10^{5}}$.

Number Theory · Mathematics 2019-02-20 Timothy Trudgian

We present a new lower bound for Euler's beta function, $B(x,y)$, which states that the inequality \begin{equation*} B(x,y)>\frac{x+y}{xy}\left(1-\frac{2xy}{x+y+1}\right) \end{equation*} holds on $(0,1]\times(0,1]$, which improves a lower…

Classical Analysis and ODEs · Mathematics 2023-05-05 Tiehong Zhao , Miaokun Wang

In this paper, we obtain the upper bounds for the Hausdorff measures of nodal sets of eigenfunctions with the Robin boundary conditions, i.e., \begin{equation*} {\left\{\begin{array}{l} \triangle u+\lambda u=0,\quad in\quad \Omega,\\…

Analysis of PDEs · Mathematics 2018-01-09 Fang Liu , Long Tian , Xiaoping Yang

This paper provides novel analytic expressions for the incomplete Toronto function, $T_{B}(m,n,r)$, and the incomplete Lipschitz-Hankel Integrals of the modified Bessel function of the first kind, $Ie_{m,n}(a,z)$. These expressions are…

Information Theory · Computer Science 2015-05-18 Paschalis C. Sofotasios , Steven Freear

We derive precise upper bounds for the maximum of the Riemann zeta function on a typical short interval of the critical line. We show that for fixed $\theta\in(-1,0]$, large $T$, and $y\geq 2$ satisfying $y=O(\log\log T/\log\log\log T)$,…

Number Theory · Mathematics 2026-05-26 Louis-Pierre Arguin , Jad Hamdan

The ideal class monoid for an order $R$ in a finite field extension $E/F$ of a number field, denoted by $\overline{\mathrm{Cl}}(R)$, is a fundamental object to study in number theory which has useful applications in algebraic geometry and…

Number Theory · Mathematics 2025-09-29 Sungmun Cho , Jungtaek Hong , Yuchan Lee

We study the binomial channel and the structure of its capacity-achieving input and output distributions. It is known that the capacity-achieving input distribution is discrete and supported on finitely many points. The best previously…

Information Theory · Computer Science 2026-05-13 Mohammadamin Baniasadi , Luca Barletta , Alex Dytso

We show that the Riemann zeta function \zeta\ has only countably many self-intersections on the critical line, i.e., for all but countably many z in C the equation \zeta(1/2+it)=z has at most one solution t in R. More generally, we prove…

Number Theory · Mathematics 2012-11-02 William Banks , Victor Castillo-Garate , Luigi Fontana , Carlo Morpurgo

The highest fidelity of quantum error-correcting codes of length n and rate R is proven to be lower bounded by 1 - exp [-n E(R)+ o(n)] for some function E(R) on noisy quantum channels that are subject to not necessarily independent errors.…

Quantum Physics · Physics 2015-06-26 Mitsuru Hamada

Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem. All lower bounds so far have made strong restrictions on the computational model.…

Computational Complexity · Computer Science 2013-05-22 Nir Ailon

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

Number Theory · Mathematics 2016-11-16 Aleksandar Ivić

We look at upper bounds for the count of certain primes related to the Fermat numbers $F_n=2^{2^n}+1$ called elite primes. We first note an oversight in a result of Krizek, Luca and Somer and give the corrected, slightly weaker upper bound.…

Number Theory · Mathematics 2021-02-02 Matthew Just

We prove a lower bound on the maximum of the Riemann zeta function in a typical short interval on the critical line. Together with the upper bound from the previous work of the authors, this implies tightness of $$ \max_{|h|\leq…

Number Theory · Mathematics 2023-07-04 Louis-Pierre Arguin , Paul Bourgade , Maksym Radziwiłł

Let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$ and let $q \ge 1$. We upper bound the $\ell_q$ norm of $T_{\epsilon} f$ by the average $\ell_q$…

Information Theory · Computer Science 2019-11-13 Alex Samorodnitsky

We consider whether L = limsup_{n to infty} n ||T^{n+1}-T^n|| < infty implies that the operator T is power bounded. We show that this is so if L<1/e, but it does not necessarily hold if L=1/e. As part of our methods, we improve a result of…

Functional Analysis · Mathematics 2013-06-04 Nigel Kalton , Stephen Montgomery-Smith , Krzysztof Oleszkiewicz , Yuri Tomilov

In this article, we improve the recent work of Hasanalizade, Shen, and Wong by establishing \[ \left| N (T) - \frac{T}{ 2 \pi} \log \left( \frac{T}{2\pi e}\right) \right|\le 0.10076\log T+0.24460\log\log T+8.08344, \] for every $T\ge e$,…

Number Theory · Mathematics 2025-07-08 Chiara Bellotti , Peng-Jie Wong

Consider exponential Carmichael function $\lambda^{(e)}$ such that $\lambda^{(e)}$ is multiplicative and $\lambda^{(e)}(p^a) = \lambda(a)$, where $\lambda$ is usual Carmichael function. We discuss the value of $\sum \lambda^{(e)}(n)$, where…

Number Theory · Mathematics 2014-05-30 Andrew V. Lelechenko

For smooth bounded domains in $\mathbb{R}$, we prove upper and lower $L^2$ bounds on the boundary data of Neumann eigenfunctions, and prove quasi-orthogonality of this boundary data in a spectral window. The bounds are tight in the sense…

Analysis of PDEs · Mathematics 2018-11-14 Alex Barnett , Andrew Hassell , Melissa Tacy

A low-power error-correcting cooling (LPECC) code was introduced as a coding scheme for communication over a bus by Chee et al. to control the peak temperature, the average power consumption of on-chip buses, and error-correction for the…

Information Theory · Computer Science 2024-12-10 Yuhao Zhao , Xiande Zhang