Marco Aymone

activity

20142026

most citedLaw of the iterated logarithm for a random Dirichlet series

10 citations · 48 across the 19 of their papers we have counts for

collaborators

Showing 2019 · math.NTShow all

2 papers · 2 filters

math.NT2019★ 9 cited

A note on multiplicative functions resembling the Möbius function

Marco Aymone

We provide examples of multiplicative functions $f$ supported on the squarefree integers, such that on primes $f (p) = \pm 1$ and such that $M_{f} (x) := \sum_{n \leq x} f (n) = o (x)$ . F…

math.NT2019★ 1 cited

The Erdős discrepancy problem over the squarefree and cubefree integers

Marco Aymone

Let $g : N \to {- 1, 1}$ be a completely multiplicative function, $μ$ be the Möbius function and $μ_{2}^{2} (n)$ be the indicator that $n$ is cubefree. We prove that $f = μ^{2} g$ and $…