Related papers: Almost sure bounds for a weighted Steinhaus random…

We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…

We construct a non - improved exponential bounds for distribution of normed sums of i.,i.d. random variables with random numbers of summand.

We consider a (random permutation model) binary search tree with n nodes and give asymptotics on the loglog scale for the height H_n and saturation level h_n of the tree as n\to\infty, both almost surely and in probability. We then consider…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

Estimates are constructed for the deviation of the concentration functions of sums of independent random variables with finite variances from the folded normal distribution function without any assumptions concerning the existence of the…

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

In the paper we prove a new upper bound for Heilbronn's exponential sum and obtain some applications of our result to distribution of Fermat quotients.

Let $f(n)$ be a strongly additive complex valued arithmetic function. Under mild conditions on $f$, we prove the following weighted strong law of large numbers: if $ X,X_1,X_2,... $ is any sequence of integrable i.i.d. random variables,…

Under correlation-type conditions, we derive upper bounds of order $\frac{1}{\sqrt{n}}$ for the Kolmogorov distance between the distributions of weighted sums of dependent summands and the normal law.

Given a multiplicative function f satisfying |f(n)| <= 1 for all n, the authors study the problem of obtaining explicit upper bounds on the mean-value 1/x |sum_{n <= x} f(n)|.

We consider a sequence $\{f(p)\}_{p\ {\rm prime}}$ of independent random variables taking values $\pm 1$ with probability $1/2$, and extend $f$ to a multiplicative arithmetic function defined on the squarefree integers. We investigate upper…

Writing for a general mathematical audience, we provide elementary upper and lower bounds on the growth (as a function of N) of the sum \sum_{n=1}^N (-1)^{\floor{n x}} for various fixed x. For example, if x is a quadratic irrational, then…

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…

We provide a sufficient characterization for subsets $\mathcal{A}$ of the polynomial ring $\mathbb{F}_q[t]$ for which partial sums of Steinhaus random multiplicative functions approach a complex standard normal distribution. This extends…

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

In this paper we present a new error bound on sampling algorithms for frequent itemsets mining. We show that the new bound is asymptotically tighter than the state-of-art bounds, i.e., given the chosen samples, for small enough error…

In 1977 Montgomery and Vaughan gave tight bounds for exponential sums of the form $\sum_{n\leq x}f(n)e(n\alpha)$ where $f$ is a $1$-bounded multiplicative function and $\alpha\in\mathbb R$, close to the conjectured $\ll \frac{x}{\sqrt{q}}+…

In this work we investigate the asymptotic behaviour of weighted partial sums of a particular class of random variables related to Oppenheim series expansions. More precisely, we verify convergence in probability as well as almost sure…

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…

The aim of this paper is to give a direct interpretation of the validity of the Riemann hypothesis up to a certain height $T$ in terms of the prime-counting function $\pi(x)$. This is done by proving the well-known explicit Schoenfeld bound…