activity
20152026
most citedMultiplicative functions that are close to their mean

13 citations · 45 across the 29 of their papers we have counts for

collaborators

33 papers

math.NT2026

On Sárközy's Local Extrema Conjectures

Alexander P. Mangerel

Let be a multiplicative function, and let . We consider the frequency with which patterns of the form $$ f(n) > ω\max\{f(n-1),f(n+1)\},…

math.NT2026

On a conjecture of Goldmakher

Alexander P. Mangerel

We construct a -bounded completely multiplicative function whose logarithmically-averaged partial sums satisfy $$ \limsup_{x \rightarrow \infty} \frac{\left|\sum_{n \leq x}…

math.NT2026

A Halász-type asymptotic formula for logarithmic means and its consequences

Oleksiy Klurman, Alexander P. Mangerel

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

math.NT2025

Sharp bounds for maximal sums of odd order Dirichlet characters

Alexander P. Mangerel

Let be fixed and odd, and for large let be a primitive Dirichlet character modulo of order . Conditionally on GRH we improve the existing upper bounds in…

math.NT2025

On a rigidity property for quadratic Gauss sums

Alexander P. Mangerel

Let be a large prime and let . We prove that if is a -valued completely multiplicative function, such that the exponential sums $$ S_f(a) := \sum_{1 \leq n…

math.NT2024

On Shusterman's Goldbach-type problem for sign patterns of the Liouville function

Alexander P. Mangerel

Let be the Liouville function. Assuming the Generalised Riemann Hypothesis for Dirichlet -functions (GRH), we show that for every sufficiently large even integer there a…

math.NT2024

On a Goldbach-type problem for the Liouville function

Alexander P. Mangerel

Let denote the Liouville function. We show that for all sufficiently large integers , the (non-trivial) convolution sum bound $$ \left|\sum_{1 \leq n < N} λ(n) λ(N-n)\right|…

math.NT2024

Large sums of high order characters II

Alexander P. Mangerel, Yichen You

Let be a primitive character modulo , and let . Assuming that has large order , for any th root of unity we obtain non-trivial upper bounds for the numbe…

math.NT2023

Gap problems for integer-valued multiplicative functions

Alexander P. Mangerel

Motivated by questions about the typical sizes of gaps in the sequence , where is an integer-valued multiplicative function, we investigate the set of…

math.NT2023

On Equal Consecutive Values of Multiplicative Functions

Alexander P. Mangerel

Let be a multiplicative function for which We show under this condition alone that for any in…

math.NT2023★ 2 cited

On Elliott's conjecture and applications

Oleksiy Klurman, Alexander P. Mangerel, Joni Teräväinen

Let be a multiplicative function. Under the merely necessary assumption that is non-pretentious (in the sense of Granville and Soundararajan), we s…

math.NT2022

Large Sums of High Order Characters

Alexander P. Mangerel

Let be a primitive character modulo a prime , and let . It has previously been observed that if has large order then for some $n \leq…

math.NT2022

Sign Changes of Fourier Coefficients of Cusp Forms at Norm Form Arguments

Alexander P. Mangerel

Let be a non-CM Hecke eigencusp form of level 1 and fixed weight, and let be its sequence of normalized Fourier coefficients. We show that if is…

math.NT2022★ 1 cited

Beyond the Erdős discrepancy problem in function fields

Oleksiy Klurman, Alexander P. Mangerel, Joni Teräväinen

We characterize the limiting behavior of partial sums of multiplicative functions . In contrast to the number field setting, the characterization depends…

math.NT2021

Three conjectures about character sums

Andrew Granville, Alexander P. Mangerel

We establish that three well-known and rather different looking conjectures about Dirichlet characters and their (weighted) sums, (concerning the Pólya-Vinogradov theorem for maxim…

math.NT2021

Squarefrees are Gaussian in short intervals

Ofir Gorodetsky, Alexander P. Mangerel, Brad Rodgers

We show that counts of squarefree integers up to in short intervals of size tend to a Gaussian distribution as long as and . This answers…

math.NT2021

Additive functions in short intervals, gaps and a conjecture of Erdős

Alexander P. Mangerel

With the aim of treating the local behaviour of additive functions, we develop analogues of the Matomäki-Radziwill theorem that allow us to approximate the average of a general add…

math.NT2021

Divisor-bounded multiplicative functions in short intervals

Alexander P. Mangerel

We extend the Matomäki-Radziwiłł theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Ou…

math.NT2020

Monotone chains of Fourier coefficients of Hecke cusp forms

Oleksiy Klurman, Alexander Mangerel

We prove general equidistribution statements (both conditional and unconditional) relating to the Fourier coefficients of arithmetically normalized holomorphic Hecke cusp forms $f_…

math.NT2020★ 4 cited

Correlations of multiplicative functions in function fields

Oleksiy Klurman, Alexander P. Mangerel, Joni Teräväinen

We develop an approach to study character sums, weighted by a multiplicative function , of the form \begin{equation} \sum_{G\in \mathcal{M}_N}f(G)χ(G)ξ(G)…

math.NT2020★ 2 cited

Squarefree Integers in Arithmetic Progressions to Smooth Moduli

Alexander P. Mangerel

Let be sufficiently small and let . We show that if is large enough in terms of then for any squarefree integer that is -sm…

math.NT2019★ 13 cited

Multiplicative functions that are close to their mean

Oleksiy Klurman, Alexander P. Mangerel, Cosmin Pohoata +1

We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new resul…

math.NT2019★ 11 cited

Multiplicative functions in short arithmetic progressions

Oleksiy Klurman, Alexander P. Mangerel, Joni Teräväinen

We study for bounded multiplicative functions sums of the form \begin{align*} \sum_{\substack{n\leq x \atop n\equiv a\pmod q}}f(n), \end{align*} establishing that their varianc…

math.NT2019

Short Character Sums and the Pólya-Vinogradov Inequality

Alexander P. Mangerel

We show in a quantitative way that any odd character modulo of fixed order satisfies the property that if the Pólya-Vinogradov inequality for can be improved…