arXiv subjects

Oleksiy Klurman

Publications and source records attributed to Oleksiy Klurman.

33 records · Page 2Linked to original sources

arXiv2021

Multiplicative functions that are close to their mean

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 results as well as strengthen existing results with new proofs. As a first application, we show that for a completely multiplicative function $f : \mathbb{N} \to \{-1,1\},$ \begin{align*} \limsup_{x\to\infty}\Big|\sum_{n\leq x}μ^2(n)f(n)\Big|=\infty. \end{align*} This confirms a conjecture of Aymone concerning the discrepancy of square-free supported multiplicative functions. Secondly, we show that a completely multiplicative function $f : \mathbb{N} \to \mathbb{C}$ satisfies \begin{align*} \sum_{n\leq x}f(n)=cx+O(1) \end{align*} with $c\neq 0$ if and only if $f(p)=1$ for all but finitely many primes and $|f(p)|<1$ for the remaining primes. This answers a question of Ruzsa. For the case $c = 0,$ we show, under the additional hypothesis $$\sum_{p }\frac{1-|f(p)|}{p} < \infty,$$ that $f$ has bounded partial sums if and only if $f(p) = χ(p)p^{it}$ for some non-principal Dirichlet character $χ$ modulo $q$ and $t \in \mathbb{R}$ except on a finite set of primes that contains the primes dividing $q$, wherein $|f(p)| < 1.$ This provides progress on another problem of Ruzsa and gives a new and simpler proof of a stronger form of Chudakov's conjecture. Along the way we obtain quantitative bounds for the discrepancy of the generalized characters improving on the previous work of Borwein, Choi and Coons.

math.NT↗

arXiv2020

Monotone chains of Fourier coefficients of Hecke cusp forms

We prove general equidistribution statements (both conditional and unconditional) relating to the Fourier coefficients of arithmetically normalized holomorphic Hecke cusp forms $f_1,\ldots,f_k$ without complex multiplication, of equal weight, (possibly different) squarefree level and trivial nebentypus. As a first application, we show that for the Ramanujan $τ$ function and any admissible $k$-tuple of distinct non-negative integers $a_1,\ldots,a_k$ the set $$ \{n \in \mathbb{N} : |τ(n+a_1)| < \cdots < |τ(n+a_k)|\} $$ has positive natural density. This result improves upon recent work of Bilu, Deshouillers, Gun and Luca [Compos. Math. (2018), no. 11, 2441-2461]. Secondly, we make progress towards understanding the signed version by showing that $$ \{n \in \mathbb{N} : τ(n+a_1) < τ(n+a_2) < τ(n+a_3)\} $$ has positive relative upper density at least $1/6$ for any admissible triple of distinct non-negative integers $(a_1,a_2,a_3).$ More generally, for such chains of inequalities of length $k > 3$ we show that under the assumption of Elliott's conjecture on correlations of multiplicative functions, the relative natural density of this set is $1/k!.$ Previously results of such type were known for $k\le 2$ as consequences of works by Serre and by Matomäki and Radziwill. Our results rely crucially on several key ingredients: i) a multivariate Erdős-Kac type theorem for the function $n \mapsto \log|τ(n)|$, conditioned on $n$ belonging to the set of non-vanishing of $τ$, generalizing work of Luca, Radziwill and Shparlinski; ii) the recent breakthrough of Newton and Thorne on the functoriality of symmetric power $L$-functions for $\text{GL}(n)$ for all $n \geq 2$ and its application to quantitative forms of the Sato-Tate conjecture; and iii) the work of Tao and Teräväinen on the logarithmic Elliott conjecture.

math.NT↗

arXiv2020

On Positivity and Minimality for Second-Order Holonomic Sequences

An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be positive if each $u_n \geq 0$, and minimal if, given any other linearly independent sequence $\langle{v_n}\rangle_{n \in\mathbb{N}}$ satisfying the same recurrence relation, the ratio $u_n/v_n$ converges to $0$. In this paper, we focus on holonomic sequences satisfying a second-order recurrence $g_3(n)u_n = g_2(n)u_{n-1} + g_1(n)u_{n-2}$, where each coefficient $g_3, g_2,g_1 \in \mathbb{Q}[n]$ is a polynomial of degree at most $1$. We establish two main results. First, we show that deciding positivity for such sequences reduces to deciding minimality. And second, we prove that deciding minimality is equivalent to determining whether certain numerical expressions (known as periods, exponential periods, and period-like integrals) are equal to zero. Periods and related expressions are classical objects of study in algebraic geometry and number theory, and several established conjectures (notably those of Kontsevich and Zagier) imply that they have a decidable equality problem, which in turn would entail decidability of Positivity and Minimality for a large class of second-order holonomic sequences.

math.NT↗

arXiv2019

A note on multiplicative automatic sequences, II

We prove that any $q$-automatic multiplicative function $f:\mathbb{N}\to\mathbb{C}$ either essentially coincides with a Dirichlet character, or vanishes on all sufficiently large primes. This confirms a strong form of a conjecture of J. Bell, N. Bruin, and M. Coons.

math.NT↗

arXiv2019

A note on multiplicative automatic sequences

We prove that any $q$-automatic completely multiplicative function $f:\mathbb{N}\to\mathbb{C}$ essentially coincides with a Dirichlet character. This answers a question of J. P. Allouche and L. Goldmakher and confirms a conjecture of J. Bell, N. Bruin and M. Coons for completely multiplicative functions. Further, assuming two standard conjectures in number theory, the methods allows for removing the assumption of completeness.

math.NT↗

arXiv2019

Boundary effect on the nodal length for Arithmetic Random Waves, and spectral semi-correlations

We test M. Berry's ansatz on nodal deficiency in presence of boundary. The square billiard is studied, where the high spectral degeneracies allow for the introduction of a Gaussian ensemble of random Laplace eigenfunctions ("boundary-adapted arithmetic random waves"). As a result of a precise asymptotic analysis, two terms in the asymptotic expansion of the expected nodal length are derived, in the high energy limit along a generic sequence of energy levels. It is found that the precise nodal deficiency or surplus of the nodal length depends on arithmetic properties of the energy levels, in an explicit way. To obtain the said results we apply the Kac-Rice method for computing the expected nodal length of a Gaussian random field. Such an application uncovers major obstacles, e.g. the occurrence of "bad" subdomains, that, one hopes, contribute insignificantly to the nodal length. Fortunately, we were able to reduce this contribution to a number theoretic question of counting the "spectral semi-correlations", a concept joining the likes of "spectral correlations" and "spectral quasi-correlations" in having impact on the nodal length for arithmetic dynamical systems. This work rests on several breakthrough techniques of J. Bourgain, whose interest in the subject helped shaping it to high extent, and whose fundamental work on spectral correlations, joint with E. Bombieri, has had a crucial impact on the field.

math.PR↗

arXiv2018

On subsets of the hypercube with prescribed Hamming distances

A celebrated theorem of Kleitman in extremal combinatorics states that a collection of binary vectors in $\{0, 1\}^n$ with diameter $d$ has cardinality at most that of a Hamming ball of radius $d/2$. In this paper, we give an algebraic proof of Kleitman's Theorem, by carefully choosing a pseudo-adjacency matrix for certain Hamming graphs, and applying the Cvetković bound on independence numbers. This method also allows us to prove several extensions and generalizations of Kleitman's Theorem to other allowed distance sets, in particular blocks of consecutive integers that do not necessarily grow linearly with $n$. We also improve on a theorem of Alon about subsets of $\mathbb{F}_{p}^{n}$ whose difference set does not intersect $\left\{0,1\right\}^{n}$ nontrivially.

math.CO↗

arXiv2018

On the Orbits of Multiplicative Pairs

We characterize all pairs of completely multiplicative functions $f,g:\mathbb{N}\to\mathbb{T}$ such that the orbit closure \[\overline{\{(f(n),g(n+1))\}_{n\ge 1}} \neq \mathbb{T}\times \mathbb{T}.\] In so doing, we settle an old conjecture of Zoltán Daróczy and Imre Kátai.

math.NT↗

arXiv2018

Polynomial products modulo primes and applications

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic fields of the form $\mathbb{Q}(\sqrt{F_P(n)})$ in short intervals $M\le n\le M+H$ previously due to Cilleruelo, Luca, Quirós and Shparlinski. As a second application, we estimate the average number of missing values of $F_P(n)(\text{mod}\ p)$ for special families of polynomials, generalizing previous work of Banks, Garaev, Luca, Schinzel, Shparlinski and others.

math.NT↗

arXiv2018

Rigidity Theorems for Multiplicative Functions

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. First, we classify all bounded completely multiplicative functions having uniformly large gaps between its consecutive values. This implies the solution of the following folklore conjecture: for any completely multiplicative function $f:\mathbb{N}\to\mathbb{T}$ we have $$\liminf_{n\to\infty}|f(n+1)-f(n)|=0.$$ Second, we settle an old conjecture due to N.G. Chudakov [Actes du ICM ({N}ice, 1970), {T}. 1, p. 487] that states that any completely multiplicative function $f:\mathbb{N}\to\mathbb{C}$ that: a) takes only finitely many values, b) vanishes at only finitely many primes, and c) has bounded discrepancy, is a Dirichlet character. This generalizes previous work of Tao on the Erdős Discrepancy Problem. Finally, we show that if many of the binary correlations of a 1-bounded multiplicative function are asymptotically equal to those of a Dirichlet character $χ$ mod $q$ then $f(n) = χ'(n)n^{it}$ for all $n$, where $χ'$ is a Dirichlet character modulo $q$ and $t \in \mathbb{R}$. This establishes a variant of a conjecture of H. Cohn for multiplicative arithmetic functions. The main ingredients include the work of Tao on logarithmic Elliott conjecture, correlation formulas for \emph{pretentious} multiplicative functions developed earlier by the first author and Szemeredi's theorem for long arithmetic progressions.

math.NT↗

arXiv2017

Effective Asymptotic Formulae for Multilinear Averages of Multiplicative Functions

Let $f_1,\ldots,f_k : \mathbb{N} \rightarrow \mathbb{C}$ be multiplicative functions taking values in the closed unit disc. Using an analytic approach in the spirit of Halász' mean value theorem, we compute multidimensional averages of the shape $$x^{-l} \sum_{\mathbf{n} \in [x]^l} \prod_{1 \leq j \leq k} f_j(L_j(\mathbf{n}))$$ as $x \rightarrow \infty$, where $[x] := [1,x]$ and $L_1,\ldots, L_k$ are affine linear forms that satisfy some natural conditions. Our approach gives a new proof of a result of Frantzikinakis and Host that is distinct from theirs, with \emph{explicit} main and error terms. \\ As an application of our formulae, we establish a \emph{local-to-global} principle for Gowers norms of multiplicative functions. We also compute the asymptotic densities of the sets of integers $n$ such that a given multiplicative function $f: \mathbb{N} \rightarrow \{-1, 1\}$ yields a fixed sign pattern of length 3 or 4 on almost all 3- and 4-term arithmetic progressions, respectively, with first term $n$.

math.NT↗

arXiv2016

On constrained Markov-Nikolskii type inequality for $k-$absolutely monotone polynomials

We consider the classical problem of estimating norms of higher order derivatives of algebraic polynomial via the norms of polynomial itself. The corresponding extremal problem for general polynomials in uniform norm was solved by A. A. Markov. In $1926,$ Bernstein found the exact constant in the Markov inequality for monotone polynomials. T. Erdelyi showed that the order of the constants in constrained Markov-Nikolskii inequality for $k-$ absolutely monotone polynomials is the same as in the classical one in case $0<p\le q\le\infty.$ In this paper, we find the exact order for all values of $0<p,q\le\infty.$ It turned out that for the case $q<p$ constrained Markov-Nikolskii inequality can be significantly improved.

math.CA↗

arXiv2016

Correlations of multiplicative functions and applications

We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce several desirable consequences:\ First, we characterize all multiplicative functions $f:\mathbb{N}\to\{-1,+1\}$ with bounded partial sums. This answers a question of Erdős from $1957$ in the form conjectured by Tao. Second, we show that if the average of the first divided difference of multiplicative function is zero, then either $f(n)=n^s$ for $\operatorname{Re}(s)<1$ or $|f(n)|$ is small on average. This settles an old conjecture of Kátai. Third, we apply our theorem to count the number of representations of $n=a+b$ where $a,b$ belong to some multiplicative subsets of $\mathbb{N}.$ This gives a new "circle method-free" proof of the result of Brüdern.

math.NT↗

arXiv2015

Distribution of factorials modulo p

We prove that the sequence $n!\,(\bmod\,p)$ occupies at least $\sqrt{\frac{3}{2}N}$ residue classes in the short interval $H\le n \le H+N$ and $N\gg p^{\frac{1}{4}}$ improving previously known trivial bound $\sqrt{N}.$ In the other direction, we estimate the average number of residue classes missed by the sequence $n!\,(\bmod\,p)$ for $p\le x.$

math.NT↗

arXiv2012

V. Markov's problem for monotone polynomials

We consider the classical problem of estimating norm of the derivative of algebraic polynomial via the norm of polynomial itself. The corresponding extremal problem for general polynomials in uniform norm was solved by V. Markov. In this note we solve analogous problem for monotone polynomials. As a consequence, we find exact constant in Bernstein inequality for monotone polynomials.

math.CA↗