English
Related papers

Related papers: Partial sums of biased random multiplicative funct…

200 papers

We investigate when the exponential sum $S_f(x,\alpha) := \sum_{n\le x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function $f$ and $\alpha\in\mathbb{R}$. We show that under natural assumptions, $S_f(x,\alpha)$ is bounded only…

Number Theory · Mathematics 2026-02-24 Pierre-Alexandre Bazin , Ihor Pylaiev , Fred Tyrrell

Let $\varepsilon >0$. Let $f$ be a Steinhaus or Rademacher random multiplicative function. We prove that we have almost surely, as $x \to +\infty$, $$ \sum_{n \leqslant x} f(n) \ll \sqrt{x} (\log_2 x)^{\frac{3}{4}+ \varepsilon}. $$

Number Theory · Mathematics 2024-08-20 Rachid Caich

Let $f$ be a real polynomial with irrational leading co-efficient. In this article, we derive distribution of $f(n)$ modulo one for all $n$ with at least three divisors and also we study distribution of $f(n)$ for all square-free $n$ with…

Number Theory · Mathematics 2024-08-06 Nilanjan Bag , Dwaipayan Mazumder

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

Number Theory · Mathematics 2017-07-13 Istvan Berkes , Michel Weber

A square-free integer is a positive integer that is not divisible by the square of any prime. Merten's function, $M(x)$ is defined as the difference between the number of square free integers with an even number of prime factors and the…

Number Theory · Mathematics 2018-05-02 Irfan Okay

We establish a normal approximation for the limiting distribution of partial sums of random Rademacher multiplicative functions over function fields, provided the number of irreducible factors of the polynomials is small enough. This…

Number Theory · Mathematics 2022-07-26 Daksh Aggarwal , Unique Subedi , William Verreault , Asif Zaman , Chenghui Zheng

We adapt the theory of partition rank and analytic rank to the category of abelian groups. If $A_1, \dots, A_k$ are finite abelian groups and $\phi : A_1 \times \cdots \times A_k \to \mathbf{T}$ is a multilinear map, where $\mathbf{T} =…

Combinatorics · Mathematics 2021-08-04 Sean Eberhard

It is known that the Bessel--Fourier coefficients $f_m$ of a function $f$ such that $\sqrt{x}f(x)$ is integrable over $[0,1]$ satisfy $f_m/\sqrt{m}\to 0$. We show a partial converse, namely that for $0\leq \alpha<1/2$ and any non-negative…

Classical Analysis and ODEs · Mathematics 2024-10-24 Ryan L. Acosta Babb

In this paper we associate with an infinite family of real extended functions defined on a locally convex space, a sum, called robust sum, which is always well-defined. We also associate with that family of functions a dual pair of problems…

Optimization and Control · Mathematics 2018-11-07 Nguyen Dinh , Miguel A. Goberna , Michel Volle

We construct a class of Fourier multipliers whose associated operators are weak (1,1) bounded but fail to be weak (p, p) bounded for any 1 < p \leq \infty. Moreover, we show that this result is sharp.

Functional Analysis · Mathematics 2025-12-02 Arup Maity

We show that the distribution of large values of an additive function on the integers, and the distribution of values of the additive function on the primes are related to each other via a Levy Process. As a consequence we obtain a converse…

Number Theory · Mathematics 2011-11-10 Maksym Radziwill

If $f$ is a symmetric complex-valued function on the $m$-fold Cartesian product of the set of non-negative reals and $A$ is a positive semi-definite $m\times m$ matrix with eigenvalues $\lambda_j$, we set…

Functional Analysis · Mathematics 2016-12-13 Lutz Klotz , Conrad Mädler

Let $V(x)$ be the number of sign changes of the partial sums up to $x$, say $M_f(x)$, of a Rademacher random multiplicative function $f$. We prove that the averaged value of $V(x)$ is at least $\gg (\log x)(\log\log x)^{-1/2-\epsilon}$. Our…

Number Theory · Mathematics 2025-04-15 Marco Aymone

We show that polynomial-time randomness (p-randomness) is preserved under a variety of familiar operations, including addition and multiplication by a nonzero polynomial-time computable real number. These results follow from a general…

Computational Complexity · Computer Science 2012-03-01 Stephen A. Fenner

An elementary recursive relation for M$\ddot{\mathrm{o}}$bius function $\mu (n)$ is introduced by two simple ways. With this recursive relation, $\mu (n)$ can be calculated without directly knowing the factorization of the $n$. $\mu (1)…

Number Theory · Mathematics 2016-12-16 Rong Qiang Wei

We introduce and analyse a general class of not necessarily bounded multiplicative functions, examples of which include the function $n \mapsto \delta^{\omega (n)}$, where $\delta \neq 0$ and where $\omega$ counts the number of distinct…

Number Theory · Mathematics 2018-10-17 Lilian Matthiesen

When restricted to some non-negative multiplicative function, say f, bounded on primes and that vanishes on non square-free integers, our result provides us with an asymptotic for $\sum_{n \le X}f(n)/n$ with error term $O((\log…

Number Theory · Mathematics 2022-01-21 Olivier Ramare , Alisa Sedunova , Ritika Sharma

Let f be a computable function from finite sequences of 0's and 1's to real numbers. We prove that strong f-randomness implies strong f-randomness relative to a PA-degree. We also prove: if X is strongly f-random and Turing reducible to Y…

We show that the sum function of the M\"{o}bius function of a Beurling number system must satisfy the asymptotic bound $M(x)=o(x)$ if it satisfies the prime number theorem and its prime distribution function arises from a monotone…

Number Theory · Mathematics 2025-06-10 Jasson Vindas

Let $P^-(n)$ denote the smallest prime factor of a natural integer $n>1$. Furthermore let $\mu$ and $\omega$ denote respectively the M\"obius function and the number of distinct prime factors function. We show that, given any set ${{\scr…

Number Theory · Mathematics 2026-03-05 Gérald Tenenbaum