Related papers: A new bound for the smallest $x$ with $\pi(x) > li…

In this work, we prove the existence of a third embedded minimal hypersurface spanning a closed submanifold $\gamma$ contained in the boundary of a compact Riemannian manifold with convex boundary, when it is known a priori the existence of…

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

We consider the Riesz and Hardy-Littlewood wave i.e. a ``critical function'' whose behaviour is concerned with the possible truth of the Riemann Hypothesis (RH). The function is studied numerically for the case alpha = 15/2 and beta = 4 in…

A well-known discovery of Feige's is the following: Let $X_1, \ldots, X_n$ be nonnegative independent random variables, with $\mathbb{E}[X_i] \leq 1 \;\forall i$, and let $X = \sum_{i=1}^n X_i$. Then for any $n$, \[\Pr[X < \mathbb{E}[X] +…

Let $\pi$ be a unitary cuspidal automorphic representation of $\mathrm{GL}_n$ over a number field, and let $\tilde{\pi}$ be contragredient to $\pi$. We prove effective upper and lower bounds of the correct order in the short interval prime…

We prove a quantitative local limit theorem for the number of descents in a random permutation. Our proof uses a conditioning argument and is based on bounding the characteristic function $\phi(t)$ of the number of descents. We also…

We prove lower bounds on the error of any estimator for the mean of a real probability distribution under the knowledge that the distribution belongs to a given set. We apply these lower bounds both to parametric and nonparametric…

An isoperimetric inequality on the Hamming cube for exponents $\beta\ge 0.50057$ is proved, achieving equality on any subcube. This was previously known for $\beta\ge \log_2(3/2)\approx 0.585$. Improved bounds are also obtained at the…

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…

Define the minimal excludant of an overpartition $\pi$, denoted $ \overline{\text{mex}}(\pi)$, to be the smallest positive integer that is not a part of the non-overlined parts of $\pi$. For a positive integer $n$, the function…

We obtain a lower bound for \[ \#\{x/2< p_{n}\leq x:\ p_n \equiv\ldots\equiv p_{n+m}\equiv a\text{ (mod $q$)},\ p_{n+m} - p_{n}\leq y\}, \] where $p_{n}$ is the $n^{\text{th}}$ prime.

Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…

We give a new lower bound for the first gap $\lambda_2 - \lambda_1$ of the Dirichlet eigenvalues of the Schr{\"o}dinger operator on a bounded convex domain $\Omega$ in R$^n$ or S$^n$ and greatly sharpens the previous estimates. The new…

In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds…

In this paper, given a topological space $X$, an interval $I\subseteq {\bf R}$ and five continuous functions $\varphi, \psi, \omega :X\to {\bf R}$, $\alpha, \beta:I\to {\bf R}$, we are interested in the infimum of the function $\Phi:X\to…

We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model…

We obtain rigorous upper and lower bounds for the error in the recent approximation for $\pi$ proposed by Chakrabarti and Hudson

This paper gives an heuristic lower bound for the number of integers connected to 1 and less than $x$, $\theta(x) > 0.9x,$ in the context of the $3n+1$ problem.

We improve the upper bound of the following inequalities for the gamma function $\Gamma$ due to H. Alzer and the author. \begin{equation*}…