Indexed metadata

On Sárközy's Local Extrema Conjectures

Alexander P. Mangerel

Source record

Source: arXiv

Published: Oct 6, 2026

arXiv: 2610.08424

Open original source ↗

Source abstract

Let f:N→(0,∞)f: \mathbb{N} \rightarrow (0,\infty) be a multiplicative function, and let ω>0ω> 0. We consider the frequency with which patterns of the form f(n)>ωmax⁡{f(n−1),f(n+1)},f(n)<1ωmin⁡{f(n−1),f(n+1)} f(n) > ω\max\{f(n-1),f(n+1)\}, \quad f(n) < \frac{1}ω\min\{f(n-1),f(n+1)\} occur in the sequence (f(n))n(f(n))_n, and give a sharp classification of all positive-valued multiplicative functions for which at least one of these patterns only occurs with logarithmic density 00. As a particular application, we resolve, in a strong form, two conjectures of A. Sárközy from 2001, classifying all multiplicative functions f:N→Nf: \mathbb{N} \rightarrow \mathbb{N} that have either finitely many local maxima, or finitely many local minima. The proof is based on a natural ``pretentiousness'' dichotomy for additive functions. Key tools in the analysis include an analogue of the Matomäki-Radziwiłłtheorem for additive functions, due to the author, as well as a new bound for the concentration of the gaps g(n+1)−g(n)g(n+1)-g(n) of an additive function gg, which may be of independent interest.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

On Sárközy's Local Extrema Conjectures — Mathematical Frontier Network