Related papers: Asymptotic error terms in Bonse-type inequalities

In this paper we establish Lebesgue-type inequalities for $2\pi$-periodic functions $f$, which are defined by generalized Poisson integrals of the functions $\varphi$ from $L_{p}$, $1\leq p< \infty$. In these inequalities uniform norms of…

This study considers the unconditional smooth R\'{e}nyi entropy, the smooth conditional R\'{e}nyi entropy proposed by Kuzuoka [\emph{IEEE Trans.\ Inf.\ Theory}, vol.~66, no.~3, pp.~1674--1690, 2020], and a new quantity which we term the…

Motivated by random walks on subsets of the hypercube, we prove two discrete functional inequalities on the hypercube. First, we give a short, elementary proof of the Poincar\'e inequality on increasing subsets of the cube recently…

Let pi = pi_1 pi_2 ... pi_n be a permutation in the symmetric group S_n written in one-line notation. The pinnacle set of pi, denoted Pin pi, is the set of all pi_i such that pi_{i-1} < pi_i > pi_{i+1}. This is an analogue of the…

Walfisz (1963) proved the asymptotic formula \[ \sum_{n\le x}\varphi(n) = \frac{3}{\pi^2}x^2+O(x(\log x)^{\frac{2}{3}}(\log\log x)^{\frac{4}{3}}), \] which improved the error term estimate of Mertens (1874) and had been the best possible…

Given a Banach space $X$, for $n\in \mathbb N$ and $p\in (1,\infty)$ we investigate the smallest constant $\mathfrak P\in (0,\infty)$ for which every $f_1,...,f_n:{-1,1}^n\to X$ satisfy \int_{{-1,1}^n}\Bigg|\sum_{j=1}^n…

We denote by $\pi\left( x\right) $ the usual prime counting function and let $li\left( x\right) $ the logarithmic integral of $x$. In 1966, R.S. Lehman came up with a new approach and an effective method for finding an upper bound where it…

We introduce a refinement of the GPY sieve method for studying prime $k$-tuples and small gaps between primes. This refinement avoids previous limitations of the method, and allows us to show that for each $k$, the prime $k$-tuples…

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…

The optimum quality that can be asymptotically achieved in the estimation of a probability p using inverse binomial sampling is addressed. A general definition of quality is used in terms of the risk associated with a loss function that…

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

We propose and analyze nonparametric tests of the null hypothesis that a function belongs to a specified parametric family. The tests are based on BIC approximations, \pi_{BIC}, to the posterior probability of the null model, and may be…

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$,…

We consider the Bernoulli bond percolation process $\mathbb{P}_{p,p'}$ on the nearest-neighbor edges of $\mathbb{Z}^d$, which are open independently with probability $p<p_c$, except for those lying on the first coordinate axis, for which…

Estimating the parameters from $k$ independent Bin$(n,p)$ random variables, when both parameters $n$ and $p$ are unknown, is relevant to a variety of applications. It is particularly difficult if $n$ is large and $p$ is small. Over the past…

In 2017, motivated by a supercongruence conjectured by Kimoto and Wakayama and confirmed by Long, Osburn and Swisher, Z.-W. Sun introduced the sequence of polynomials: $$…

Given a Dirichlet series $L(s) = \sum a_n n^{-s}$, the asymptotic growth rate of $\sum_{n\le X} a_n$ can be determined by a Tauberian theorem. Bounds on the error term are typically controlled by the size of $|L(\sigma+it)|$ for fixed real…

Given the asymptotic expansion for the logarithmic integral $\int_0^n \frac{dt}{\ln(t)}$, obtained from repeated integration by parts until the expansion terms reach a minimum; approaching zero. Which determines a cut-off for the number 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…

Elliott and Halberstam proved that $\sum_{p<n} 2^{\omega(n-p)}$ is asymptotic to $\phi(n)$. In analogy to the Erd\H{o}s--Kac Theorem, Elliott conjectured that if one restricts the summation to primes $p$ such that $\omega(n-p)\le 2 \log…