Related papers: Partial sums of biased random multiplicative funct…

Studying Birkhoff sums of non-integrable functions involves the challenge of large observations depending on the sampled orbit, which prevents pointwise limit theorems. To address this issue, the largest observations are removed, this…

Let $f$ be a completely multiplicative function that assumes values inside the unit disc. We show that if $\sum_{n<x} f(n) \ll x/(\log x)^A$, $x>2$, for some $A>2$, then either $f(p)$ is small on average or $f$ pretends to be $\mu(n)n^{it}$…

We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.

Define {\em the Liouville function for $A$}, a subset of the primes $P$, by $\lambda_{A}(n) =(-1)^{\Omega_A(n)}$ where $\Omega_A(n)$ is the number of prime factors of $n$ coming from $A$ counting multiplicity. For the traditional Liouville…

A $\textit{square-full}$ number is a positive integer for which all its prime divisors divide itself at least twice. The counting function of square-full integers of the form $f(n)$ for $n\leqslant N$ is denoted by…

We provide a simple proof that the partial sums $\sum_{n\leq x}f(n)$ of a Rademacher random multiplicative function $f$ change sign infinitely often as $x\to\infty$, almost surely.

We consider the problem of $\Omega$ bounds for the partial sums of a modified character, \textit{i.e.}, a completely multiplicative function $f$ such that $f(p)=\chi(p)$ for all but a finite number of primes $p$, where $\chi$ is a primitive…

We study Martin-L\"{o}f random (ML-random) points on computable probability measures on sample and parameter spaces (Bayes models). We consider variants of conditional randomness defined by ML-randomness on Bayes models and those of…

We consider degenerate differential operators $A = \displaystyle{\sum_{k,j=1}^d \partial_k (a_{kj} \partial_j)}$ on $L^2(\mathbb{R}^d)$ with real symmetric bounded measurable coefficients. Given a function $\chi \in…

In this paper, we broaden Shiu's Brun-Titchmarsh theorem to allow for functions that are larger and/or smooth-supported. In particular, let $f$ be a nonnegative multiplicative function. We prove that if there exists a $\beta<1$ such that…

We consider the sum of the reciprocals of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an asymptotic expansion in the first case and an asymptotic formula involving an implicit parameter in the…

We consider logarithmic averages, over friable integers, of non-negative multiplicative functions. Under logarithmic, one-sided or two-sided hypotheses, we obtain sharp estimates that improve upon known results in the literature regarding…

Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in…

We study Birkhoff sums over rotations (series of the form $\sum_{r=1}^{N}\phi(r\alpha)$), in which the summed function $\phi$ may be unbounded at the origin. Estimates of these sums have been of significant interest and application in pure…

Let $2 \leq y \leq x$ such that $\beta := \frac{\log x}{\log y} \rightarrow \infty$. Let $\omega_y(n)$ denote the number of distinct prime factors $p$ of $n$ such that $p \leq y$, and let $\mu_y(n) := \mu^2(n)(-1)^{\omega_y(n)}$, where…

Let $A$ be a random subset of $\mathbb{Z}_{N}$ obtained by including each element of $\mathbb{Z}_{N}$ in $A$ independently with probability $p$. We say that $A$ is \emph{linear} if the only Freiman homomorphisms are given by the…

Given an arithmetic function $g(n)$ write $M_g(x) := \sum_{n \leq x} g(n)$. We extend and strengthen the results of a fundamental paper of Hal\'{a}sz in several ways by proving upper bounds for the ratio of $\frac{|M_g(x)|}{M_{|g|}(x)}$,…

The asymptotic behavior of expressions of the form $% \sum_{t=1}^{n}f(r_{n}x_{t})$ where $x_{t}$ is an integrated process, $r_{n}$ is a sequence of norming constants, and $f$ is a measurable function has been the subject of a number of…

The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…