Related papers: Improving and Maximal Inequalities for Primes in P…

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

In the first paper under this title (1977), the first author utilized a duality identity between the largest and smallest prime factors involving the Moebius function, to establish the following result as a consequence of the Prime Number…

Let $\Lambda(n)$ be the von Mangoldt function, and let $[t]$ be the integral part of real number $t$. In this note, we prove that for any $\varepsilon>0$ the asymptotic formula $$ \sum_{n\le x} \Lambda\Big(\Big[\frac{x}{n}\Big]\Big) =…

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

Let $f$ be a polynomial with integer coefficients whose degree is at least 2. We consider the problem of covering the orbit $\operatorname{Orb}_f(t)=\{t,f(t),f(f(t)),\cdots\}$, where $t$ is an integer, using arithmetic progressions each of…

The paper deals with the problem of ideals of $H^\infty$: describe increasing functions $\phi\ge 0$ such that for all bounded analytic functions $f_1,f_2,...,f_n, \tau$ in the unit disc $D$ the condition $|\tau(z) | \le \phi(\sum_k…

We will show in this paper that if $\lambda$ is very close to 1, then $$I(M,\lambda,m)= \sup_{u\in H^{1,n}_0(M) ,\int_M|\nabla u|^ndV=1}\int_\Omega (e^{\alpha_n |u|^\frac{n}{n-1}}-\lambda\sum\limits_{k=1}^m\frac{|\alpha_nu^\frac{n}{n-1}|^k}…

The primorial $p\#$ of a prime $p$ is the product of all primes $q\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\# \mid \phi(n)$, where $\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\log\log…

A refinement of Bennett's inequality is introduced which is strictly tighter than the classical bound. The new bound establishes the convergence of the average of independent random variables to its expected value. It also carefully…

The well-known Bennett-Hoeffding bound for sums of independent random variables is refined, by taking into account truncated third moments, and at that also improved by using, instead of the class of all increasing exponential functions,…

In his 1979 paper Samuel Wagstaff studied the problem of bounding the first prime in an arithmetic progression. In this paper we update a number of his computations using advances in hardware. Based on this we refine his conjecture on…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…

Let $p$ be a prime number, $k\ge 0$ and $f$ be a class of arithmetic functions satisfying some simple conditions. In this short paper, we study the asymptotical behaviour of summation function $$\psi_{f,k}(x):=\sum_{n\le x}\Lambda…

A new upper bound on the relative entropy is derived as a function of the total variation distance for probability measures defined on a common finite alphabet. The bound improves a previously reported bound by Csisz\'ar and Talata. It is…

Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…

Morrey's classical inequality implies the H\"older continuity of a function whose gradient is sufficiently integrable. Another consequence is the Hardy-type inequality $$ \lambda\biggl\|\frac{u}{d_\Omega^{1-n/p}}\biggr\|_{\infty}^p\le…

The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…

Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…