ID: 2401.16256

Bounds for exponential sums with random multiplicative coefficients

January 29, 2024

View on ArXiv

Similar papers 3

Almost sure upper bound for a model problem for multiplicative chaos in number theory

April 4, 2023

84% Match
Rachid Caich
Number Theory
Probability

We give a proof a comparable result to a recent result of the author concerning almost sure upper bound of random multiplicative functions, in a more simplified setting. Having a simpler quantity allows us to make the proof more accessible.

Find SimilarView on arXiv

Inequalities Concerning Maximum Modulus and Zeros of Random Entire Functions

December 14, 2020

84% Match
Hui Li, Jun Wang, ... , Ye Zhuan
Complex Variables

Let $f_\omega(z)=\sum\limits_{j=0}^{\infty}\chi_j(\omega) a_j z^j$ be a random entire function, where $\chi_j(\omega)$ are independent and identically distributed random variables defined on a probability space $(\Omega, \mathcal{F}, \mu)$. In this paper, we first define a family of random entire functions, which includes Gaussian, Rademacher, Steinhaus entire functions. Then, we prove that, for almost all functions in the family and for any constant $C>1$, there exist a cons...

Find SimilarView on arXiv

Partial sums of typical multiplicative functions over short moving intervals

July 24, 2022

83% Match
Mayank Pandey, Victor Y. Wang, Max Wenqiang Xu
Number Theory
Probability

We prove that the $k$-th positive integer moment of partial sums of Steinhaus random multiplicative functions over the interval $(x, x+H]$ matches the corresponding Gaussian moment, as long as $H\ll x/(\log x)^{2k^2+2+o(1)}$ and $H$ tends to infinity with $x$. We show that properly normalized partial sums of typical multiplicative functions arising from realizations of random multiplicative functions have Gaussian limiting distribution in short moving intervals $(x, x+H]$ wit...

Find SimilarView on arXiv

On the Balog-Ruzsa Theorem in short intervals

April 28, 2022

83% Match
Yu-Chen Sun
Number Theory
Classical Analysis and ODEs
Combinatorics

In this paper we give a short interval version of the Balog-Ruzsa theorem concerning bounds for the $L_1$ norm of the exponential sum over $r$-free numbers. As an application, we give a lower bound for the $L_1$ norm of the exponential sum defined with the M\"obius function. Namely we show that $$\int_{{\mathbb T}} \left|\sum_{|n-N|<H} \mu(n)e(n \alpha)\right| d \alpha \gg H^{\frac{1}{6}}$$ when $H \gg N^{\frac{9}{17} + \varepsilon}$.

Find SimilarView on arXiv

On the limit distributions of some sums of a random multiplicative function

December 1, 2010

83% Match
Adam J. Harper
Number Theory
Probability

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 over those n \leq x with k distinct prime factors, provided that k = o(log log x) as x \rightarrow \infty. We estimate the fourth moments of these sums, and use a conditioning argument to show that if k is of the order of magnitude of log log...

Find SimilarView on arXiv

Asymptotics for sums of functions of primes

August 16, 2020

83% Match
Victor Volfson
Number Theory

This work gives a general approach to the determination of the asymptotic behavior of the sums of functions of primes based on the distribution of primes. It refines the estimate of the remainder term of the asymptotic expansion of the sums of functions of primes. Also, the necessary and sufficient conditions for the existence of these asymptotics are proved in the paper.

Find SimilarView on arXiv

Estimation of the asymptotic behavior of summation functions

September 22, 2022

83% Match
Victor Volfson
General Mathematics

The paper considers asymptotics of summation functions of additive and multiplicative arithmetic functions. We also study asymptotics of summation functions of natural and prime arguments. Several assertions on this subject are proved and examples are considered.

Find SimilarView on arXiv

The $L^1$ mean of the exponential sum of the divisor function

April 6, 2024

83% Match
Tomos Parry
Number Theory

We give a relatively simple proof that \[ \int _0^1\left |\sum _{n\leq x}d(n)e(n\alpha )\right |d\alpha \asymp \sqrt x.\]

Find SimilarView on arXiv

Sommes friables de fonctions multiplicatives al\'eatoires

December 6, 2017

83% Match
Joseph Basquin
Number Theory

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 bounds for $\Psi_f(x,y)$, the summatory function of $f$ on $y$-friable integers $\leq x$. We obtain estimations of the type $\Psi_f(x,y) \ll \Psi(x,y)^{1/2+\epsilon}$, more precise formulas being given in suitable regions for $x,y$. In the...

Find SimilarView on arXiv

A Strengthening of Theorems of Hal\'asz and Wirsing

April 1, 2016

83% Match
Alexander P. Mangerel
Number Theory

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)}$, for any strongly multiplicative, complex-valued function $g(n)$ under certain assumptions on the sequence $\{g(p)\}_p$. We further prove an asymptotic formula for this ratio in the case that $|\text{arg}(g(p))|$ is sufficiently small uniforml...

Find SimilarView on arXiv