Related papers: Improved bounds on Brun's constant

Entropic uncertainty relations place nontrivial lower bounds to the sum of Shannon information entropies for noncommuting observables. Here we obtain a novel lower bound on the entropy sum for general pairs of observables in…

In this article, we address the lower bounds for the sums $a_f(p)+a_g(p)$ of the $p$-th Fourier coefficients of two twist-inequivalent, non-CM normalized newforms $f$ and $g$. Our main result shows that for such forms with integer Fourier…

In a previous paper [6] we have extended Nitsche's method [8] for the Poisson equation with general Robin boundary conditions. The analysis required that the solution is in H^s, with s > 3/2. Here we give an improved error analysis using a…

The Brunn-Minkowski inequality states that for bounded measurable sets $A$ and $B$ in $\mathbb{R}^n$, we have $|A+B|^{1/n} \geq |A|^{1/n}+|B|^{1/n}$. Also, equality holds if and only if $A$ and $B$ are convex and homothetic sets in…

We establish improved finite field Szemeredi-Trotter and Beck type theorems. First we show that if P and L are a set of points and lines respectively in the plane F_p^2, with |P|,|L| \leq N and N<p, then there are at most C_1…

In the paper, the authors discover the best constants $\alpha_{1}$, $\alpha_{2}$, $\beta_{1}$, and $\beta_{2}$ for the double inequalities $$ \alpha_{1}\bar{C}(a,b)+(1-\alpha_{1}) A(a,b)< T(a,b) <\beta_{1} \bar{C}(a,b)+(1-\beta_{1})A(a,b)…

In this paper we give and prove a criterion for the normality of unbounded closed operators, which is a sort of a maximality result which will be called "double maximality". As applications, we show, under some assumptions, that the sum of…

One aspect of Poisson approximation is that the support of the random variable of interest is often finite while the support of the Poisson distribution is not. In this paper we will remedy this by examining truncated negative binomial (of…

Let $P(a,q)$ be the least prime in the arithmetic progression $\{n\equiv a(mod\ q)\}$. In this note, when $q$ has bounded cubic part and $(a,q)=1$, we combine the Heath-Brown's method and the Burgess's bounds for L-functions to obtain $…

The results of this note arise a rupture between the behavior of the real and complex best known constants for the multilinear Bohnenblust--Hille inequality; in one side, for real scalars, we show that new upper bounds for the real…

A binary matrix is a matrix with entries from the set $\{0,1\}$. We say that a binary matrix $A$ contains a binary matrix $S$ if $S$ can be obtained from $A$ by removal of some rows, some columns, and changing some $1$-entries to…

Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=2.25$. Their construction relies on…

We prove a sharp stability result for the Brunn-Minkowski inequality for $A,B\subset\mathbb{R}^2$. Assuming that the Brunn-Minkowski deficit $\delta=|A+B|^{\frac{1}{2}}/(|A|^\frac12+|B|^\frac12)-1$ is sufficiently small in terms of…

Bruss's odds theorem \cite{Bruss1} addresses the problem of determining the optimal stopping time for sequences of independent indicator functions. In this note, we derive upper and lower bounds for the success probability under the optimal…

The Bounded Negativity Conjecture predicts that for any smooth complex surface $X$ there exists a lower bound for the selfintersection of reduced divisors on $X$. This conjecture is open. It is also not known if the existence of such a…

Let $p$ be an odd prime, Jianqiang Zhao has established a curious congruence, which is $$ \sum_{i+j+k=p \atop i,j,k > 0} \frac{1}{ijk} \equiv -2B_{p-3}\pmod p , $$ where $B_{n}$ denotes the $n$-th Bernoulli number. In this paper, we will…

Consider averages along the prime integers $ \mathbb P $ given by \begin{equation*} \mathcal{A}_N f (x) = N ^{-1} \sum_{ p \in \mathbb P \;:\; p\leq N} (\log p) f (x-p). \end{equation*} These averages satisfy a uniform scale-free $ \ell…

We propose an algorithm to numerically determined whether a second-order linear PDE problem satisfying a Garding inequality is well-posed. This algorithm further provides a lower bound to the inf-sup constant of the weak formulation, which…

We say that a pair $(\mathcal{A},\mathcal{B})$ is a recovering pair if $\mathcal{A}$ and $\mathcal{B}$ are set systems on an $n$ element ground set, such that for every $A,A' \in \mathcal{A}$ and $B,B' \in \mathcal{B}$ we have that ($A…

Let $p_1 = 2, p_2 = 3,...$ be the sequence of all primes. Let $\epsilon$ be an arbitrarily small but fixed positive number, and fix a coprime pair of integers $q \ge 3$ and $a$. We will establish a lower bound for the number of primes…