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

Assuming the Riemann Hypothesis, Soundararajan showed that $\displaystyle{\int_{0}^{T} \vert \zeta(1/2 + it)\vert^{2k} \ll T(\log T)^{k^2 + \epsilon}}$ . His method was used by Chandee to obtain upper bounds for shifted moments of the…

Let $\varphi(n)$ denote the Euler totient function. In this paper, we first establish a new upper bound for $n/\varphi(n)$ involving $K(n)$, the function that counts the number of primorials not exceeding $n$. In particular, this leads to…

We find an explicit upper bound for general $L$-functions on the critical line, assuming the Generalized Riemann Hypothesis, and give as illustrative examples its application to some families of $L$-functions and Dedekind zeta functions.…

Assuming the Generalised Riemann Hypothesis, we prove a sharp upper bound on moments of shifted Dirichlet $L$-functions. We use this to obtain conditional upper bounds on high moments of theta functions. Both of these results strengthen…

We consider transfer operators acting on spaces of holomorphic functions, and provide explicit bounds for their eigenvalues. More precisely, if D is any open set in C^d, and L is a suitable transfer operator acting on Bergman space A^2(D),…

We consider the problem of estimating the eigenvalues and the integral of the corresponding eigenfunctions, associated to the Newtonian potential operator, defined in a bounded domain $\Omega \subset \mathbb{R}^{d},$ where $d = 2, 3$, in…

We show that the variance of centred linear statistics of eigenvalues of GUE matrices remains bounded for large $n$ for some classes of test functions less regular than Lipschitz functions. This observation is suggested by the limiting form…

The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the…

In the present paper, we show that under the Riemann hypothesis, and for fixed $h, \epsilon > 0$, the supremum of the real and the imaginary parts of $\log \zeta (1/2 + it)$ for $t \in [UT -h, UT + h]$ are in the interval $[(1-\epsilon)…

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

Linear independence testing is a fundamental information-theoretic and statistical problem that can be posed as follows: given $n$ points $\{(X_i,Y_i)\}^n_{i=1}$ from a $p+q$ dimensional multivariate distribution where $X_i \in…

We prove under RH the existence of a very large positive and negative values of the argument of the Riemann zeta function on a very short intervals.

Assuming the Riemann Hypothesis, we provide explicit upper bounds for moduli of $S(t)$, $S_1(t)$, and $\zeta\left(1/2+\mathrm{i}t\right)$ while comparing them with recently proven unconditional ones. As a corollary we obtain a conditional…

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…

Fix integers $1\le k<n$, and numbers $a,s$ satisfying $0<s<\min\{k,a\}$. The problem of exceptional set estimate is to determine \[T(a,s):=\sup_{A\subset \mathbb{R}^n\ \text{dim}A=a}\text{dim}(\{ V\in G(k,n): \text{dim}(\pi_V(A))<s \}). \]…

In this paper, we introduce various covering number bounds for linear function classes, each subject to different constraints on input and matrix norms. These bounds are contingent on the rank of each class of matrices. We then apply these…

The prime counting function inequality $\pi(x+y) < \pi(x)+\pi(y)$, which is known as Hardy-Littlewood conjecture, has been established for a variety of cases such as $ \delta x \leq y \leq x$, where $0< \delta \leq 1$, and $x \leq y\leq x…

The upper bound on the capacity of a 3-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. Y and Z are independent given X, and the link from Z to Y…

Individual treatment effect (ITE) is often regarded as the ideal target of inference in causal analyses and has been the focus of several recent studies. In this paper, we describe the intrinsic limits regarding what can be learned…

Kayal, Saha and Tavenas [Theory of Computing, 2018] showed that for all large enough integers $n$ and $d$ such that $d\geq \omega(\log{n})$, any syntactic depth four circuit of bounded individual degree $\delta = o(d)$ that computes the…