English
Related papers

Related papers: Fake Mu's

200 papers

In this short note we prove the following result: If a completely multiplicative function $f:\mathbb{N}\to[-1,1]$ is small on average in the sense that $\sum_{n\leq x}f(n)\ll x^{1-\delta}$, for some $\delta>0$, and if the Dirichlet series…

Number Theory · Mathematics 2021-11-30 Marco Aymone

Denote by $\lambda(n)$ Liouville's function concerning the parity of the number of prime divisors of $n$. Using a theorem of Allouche, Mend\`es France, and Peyri\`ere and many classical results from the theory of the distribution of prime…

Number Theory · Mathematics 2008-10-30 Michael Coons

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…

Number Theory · Mathematics 2026-03-09 Jake Chinis , Besfort Shala

We establish several results concerning the expected general phenomenon that, given a multiplicative function $f:\mathbb{N}\to\mathbb{C}$, the values of $f(n)$ and $f(n+a)$ are "generally" independent unless $f$ is of a "special" form.…

Number Theory · Mathematics 2018-01-11 Oleksiy Klurman , Alexander P. Mangerel

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…

Number Theory · Mathematics 2025-09-26 Thomas Wright

The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 $f: \{\pm1\}^n…

Data Structures and Algorithms · Computer Science 2011-01-28 Dana Ron , Ronitt Rubinfeld , Muli Safra , Omri Weinstein

We consider the asymptotic expansion of the Mathieu-Bessel series \[S_\nu(a,b)=\sum_{n=1}^\infty \frac{n^\gamma J_\nu(nb/a)}{(n^2+a^2)^\mu}, \qquad (\mu, b>0,\ \gamma, \nu\in {\bf R})\] as $a\to+\infty$ with the other parameters held fixed,…

Classical Analysis and ODEs · Mathematics 2019-07-09 R B Paris

Given any non-polynomial $G$-function $F(z)=\sum\_{k=0}^\infty A\_k z^k$ of radius of convergence $R$, we consider the $G$-functions $F\_n^{[s]}(z)=\sum\_{k=0}^\infty \frac{A\_k}{(k+n)^s}z^k$ for any integers $s\geq 0$ and $n\geq 1$. For…

Number Theory · Mathematics 2017-02-01 Stéphane Fischler , Tanguy Rivoal

Let $d$ be a positive integer, and let $\mu$ be a finite measure on $\br^d$. In this paper we ask when it is possible to find a subset $\Lambda$ in $\br^d$ such that the corresponding complex exponential functions $e_\lambda$ indexed by…

Functional Analysis · Mathematics 2008-11-14 Dorin Ervin Dutkay , Palle Jorgensen

Let $\lambda$ denote the Liouville function. We show that, as $X \rightarrow \infty$, $$\int_{X}^{2X} \sup_{\substack{P(Y)\in \mathbb{R}[Y]\\ deg(P)\leq k}} \Big | \sum_{x \leq n \leq x + H} \lambda(n) e(-P(n)) \Big |\ dx = o ( X H)$$ for…

Number Theory · Mathematics 2023-02-21 Kaisa Matomäki , Maksym Radziwiłł , Terence Tao , Joni Teräväinen , Tamar Ziegler

This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…

Machine Learning · Statistics 2015-10-06 Alekh Agarwal , Leon Bottou

Let $f$ be a Rademacher or Steinhaus random multiplicative function. For various arithmetically interesting subsets $\mathcal A\subseteq [1, N]\cap\mathbb N$ such that the distribution of $\sum_{n\in \mathcal A} f(n)$ is approximately…

Number Theory · Mathematics 2026-03-04 Besfort Shala

Let $\lambda$ denote the Liouville function. We prove that $$\sum_{X \leq x < 2X} \sup_{\alpha \in \mathbb{R}/\mathbb{Z}} \bigg\lvert\!\sum_{x \leq n < x+H} \lambda(n) e(n\alpha)\bigg\rvert = o(HX)$$ as $X\to \infty$, in the regime $H =…

Number Theory · Mathematics 2026-04-30 Cédric Pilatte

Let $\lambda$ and $\mu$ denote the Liouville and M\"obius functions respectively. Hildebrand showed that all eight possible sign patterns for $(\lambda(n), \lambda(n+1), \lambda(n+2))$ occur infinitely often. By using the recent result of…

Number Theory · Mathematics 2015-09-24 Kaisa Matomäki , Maksym Radziwiłł , Terence Tao

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…

Number Theory · Mathematics 2008-09-11 Peter Borwein , Stephen K. K. Choi , Michael Coons

For the Fourier transform $\mathcal{F}\mu$ of a general (non-trivial) self-similar measure $\mu$ on the real line $\mathbb{R}$, we prove a large deviation estimate \[ \lim_{c\to +0} \varlimsup_{t\to \infty}\frac{1}{t}\log…

Dynamical Systems · Mathematics 2013-04-02 Masato Tsujii

Surprisingly, apart from some special cases, simple asymptotic expansions for the associated Legendre functions $P_\nu ^\mu (z)$ and $Q_\nu ^\mu (z)$ for large degree $\nu$ or large order $\mu$ are not available in the literature. The main…

Classical Analysis and ODEs · Mathematics 2020-02-07 Gergő Nemes , Adri B. Olde Daalhuis

We establish an asymptotic formula for the logarithmic mean value of a 1-bounded multiplicative function that is sharp in many cases of interest. We derive from it a variety of applications, making progress on several old problems. As a…

Number Theory · Mathematics 2026-04-09 Oleksiy Klurman , Alexander P. Mangerel

We establish completely log-free bounds for exponential sums over the primes and the M\"{o}bius function. Let $0<\eta \leq 1/10$, and suppose $\alpha = a/q + \delta/x$, with $(a,q)=1$ and $|\delta| \leq x^{1/5 + \eta}/q$, and set $\delta_0…

Number Theory · Mathematics 2026-01-28 Priyamvad Srivastav

We give a new proof of Fatou's theorem: {\em if an algebraic function has a power series expansion with bounded integer coefficients, then it must be a rational function.} This result is applied to show that for any non--trivial completely…

Number Theory · Mathematics 2008-06-11 Michael Coons , Peter Borwein