To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
In this paper, we establish lower bounds for extreme values of derivatives of Dirichlet L-functions in the range $1/2<\sigma <1$. Compared with the work of Aistleitner et al. [‘On large values of $L(\sigma , \chi )$’, Q. J. Math.70 (2019), 831–848], our result shows that derivatives of Dirichlet L-functions can attain extreme values of the same order of magnitude as the original L-functions in the interval ${1/2<\sigma <1}$.
We investigate the mean square behavior of error terms that arise in the summation of $\gcd (n_1,\ldots ,n_k)$ with $n_1\ldots n_k \le x$. We first analyze error terms related to certain Dirichlet series $\zeta ^2(s)\zeta (2s-1)\zeta ^M(2s)$ and obtain upper bounds for their mean squares, depending on the parameter M. We then extend our analysis to the general case with $k \ge 3$, providing estimates for the mean square of the corresponding error terms.
We study the first moment of primitive cubic $L$-functions over $\mathbb {F}_q(T)$ in the non-Kummer setting $q\equiv 2\ {\mathrm{mod}}\ 3$. More precisely, we study the sum
where $L_q(s,\chi )$ denotes the $L$-function associated with primitive cubic character $\chi $. Using a double Dirichlet series, we obtain an asymptotic formula with an error term of size $q^{(\frac {7}{8}+\varepsilon )g}$. The argument avoids an explicit residue computation and clarifies why the poles at $u^3=1$ do not contribute, thereby resolving the question left in Remark 4.6 of David et al. (2019, algebra number theory).
We analyze the average behavior of various arithmetic functions at the values of degree $d$ binary forms ordered by height, with probability $1$. This approach yields averaged versions of the Chowla conjecture and the Bateman–Horn conjecture for random binary forms. Furthermore, we show that the rational Hasse principle holds for almost all Châtelet varieties defined by a fixed norm form of degree $e$ and by varying binary forms of fixed degree $d$, provided $e$ divides $d$. This proves an average version of a conjecture of Colliot-Thélène.
Let f and g be two distinct Hecke–Maass cusp forms of weight zero for the full modular group $SL(2,\mathbb {Z})$ with Laplacian eigenvalues $\frac {1}{4}+t_{1}^{2}$ and $\frac {1}{4}+t_{2}^{2}$, and denote by $\lambda _{f}(n)$ and $\lambda _{g}(n)$ the n-th normalized Fourier coefficients attached to f and g, respectively. In the present article, we establish a quantitative result regarding the sign changes of the sequence $\{\lambda _{f}(n)\lambda _{g}(n)\}_{n\geqslant 1}$ in the interval $(x,2x]$, supported at a certain primitive integral binary quadratic form with fixed negative discriminant $D<0$, for sufficiently large x.
In this paper, we establish a lower bound for the maxima of derivatives of the Dedekind zeta function of a cyclotomic field on the critical line. Employing a double-version convolution formula and combined with special GCD sums, our result generalizes the work of Bondarenko et al. [‘A dichotomy for extreme values of zeta and Dirichlet L-functions’, Bull. Lond. Math. Soc.55 (2023), 2963–2975]. We also establish a lower bound via the resonance method when the real part is near the critical line; both of the above results refine parts of Yang’s [‘Extreme values of derivatives of the Riemann zeta function’, Mathematika68 (2022), 486–510] work.
In this note, we study bounded functions of invariant average under multiplication. We show that if an arithmetic function is of moderate growth, then it is asymptotically uncorrelated to such functions. This provides several new disjointness results on the distribution of orbits along $\Omega (n)$.
In 1970, Apostol introduced the Möbius function of order k for an integer $k\ge 1$. In 2001, it was generalized by Bege to the Möbius function $\mu _{k,m}$ of two parameters for any integers $m\ge k\ge 1$. In this article, we will establish three kinds of asymptotic formulas related to $\mu _{k,m}$ for $m\ge k\ge 2$ in a unified elementary method. These formulas are related to the shifted convolution sums of Fourier coefficients of holomorphic cusp forms, Bergelson and Richter’s dynamical generalization of the prime number theorem, and the Titchmarsh divisor problem.
We prove that the average size of a mixed character sum
\begin{equation*}\sum_{1\leqslant n \leqslant x} \chi(n) e(n\theta) w(n/x)\end{equation*}
(for a suitable smooth function $w$) is on the order of $\sqrt{x}$ for all irrational real $\theta$ satisfying a weak Diophantine condition, where $\chi$ is drawn from the family of Dirichlet characters modulo a large prime $r$ and where $x\leqslant r$. In contrast, it was proved by Harper that the average size is $o(\sqrt{x})$ for rational $\theta$. Certain quadratic Diophantine equations play a key role in the present paper.
Martin, Mossinghoff, and Trudgian [19] recently introduced a family of arithmetic functions called “fake $\mu $’s,” which are multiplicative functions for which there is a $\{-1,0,1\}$-valued sequence $(\varepsilon _j)_{j=1}^{\infty }$ such that $f(p^j) = \varepsilon _j$ for all primes p. They investigated comparative number-theoretic results for fake $\mu $’s and, in particular, proved oscillation results at scale $\sqrt {x}$ for the summatory functions of fake $\mu $’s with $\varepsilon _1=-1$ and $\varepsilon _2=1$. In this article, we establish new oscillation results for the summatory functions of all nontrivial fake $\mu $’s at scales $x^{1/2\ell }$ where $\ell $ is a positive integer (the “critical index”) depending on f; for $\ell =1$ this recovers the oscillation results in [19]. Our work also recovers results on the indicator functions of powerfree and powerfull numbers; we generalize techniques applied to each of these examples to extend to all fake $\mu $’s.
We provide new upper bounds for sums of certain arithmetic functions in many variables at polynomial arguments and, exploiting recent progress on the mean-value of the Erdős—Hooley $\Delta$-function, we derive lower bounds for the cardinality of those integers not exceeding a given limit that are expressible as certain sums of powers.
Let $k{\geqslant} 2$ be an integer and let $\lambda$ be the Liouville function. Given k non-negative distinct integers $h_1,\ldots,h_k$, the Chowla conjecture claims that $\sum_{n{\leqslant} x}\lambda(n+h_1)\cdots \lambda(n+h_k)=o(x)$. An unconditional answer to this conjecture is yet to be found, and in this paper, we take a conditional approach. More precisely, we establish a non-trivial bound for the sums $\sum_{n{\leqslant} x}\lambda(n+h_1)\cdots \lambda(n+h_k)$ under the existence of a Landau–Siegel zero for x in an interval that depends on the modulus of the character whose Dirichlet series corresponds to the Landau–Siegel zero. Our work constitutes an improvement over the previous related results of Germán and Kátai, Chinis and Tao and Teräväinen.
The aim of this work is to prove a new sure upper bound in a setting that can be thought of as a simplified function field analogue. This result is comparable to a recent result of the author concerning an almost sure upper bound of random multiplicative functions. Having a simpler quantity allows us to make the proof more accessible.
Bergelson and Richter [‘Dynamical generalizations of the prime number theorem and disjointness of additive and multiplicative semigroup actions’, Duke Math. J.171(15) (2022), 3133–3200] established a new dynamical generalisation of the prime number theorem (PNT) and the PNT for arithmetic progressions. Let $h\ge 1, k\ge 2$. Mirsky [‘Note on an asymptotic formula connected with r-free integers’, Quart. J. Math. Oxford Ser.18 (1947), 178–182] showed that the numbers n such that $n+l_1,\ldots , n+l_h$ are k-free have a natural density for any given nonnegative integers $l_1,\ldots , l_h$. In this note, we show that the Bergelson–Richter theorem holds for the numbers studied by Mirsky.
We address a core partition regularity problem in Ramsey theory by proving that every finite coloring of the positive integers contains monochromatic Pythagorean pairs (i.e., $x,y\in {\mathbb N}$ such that $x^2\pm y^2=z^2$ for some $z\in {\mathbb N}$). We also show that partitions generated by level sets of multiplicative functions taking finitely many values always contain Pythagorean triples. Our proofs combine known Gowers uniformity properties of aperiodic multiplicative functions with a novel and rather flexible approach based on concentration estimates of multiplicative functions.
We prove structural results for measure-preserving systems, called Furstenberg systems, naturally associated with bounded multiplicative functions. We show that for all pretentious multiplicative functions, these systems always have rational discrete spectrum and, as a consequence, zero entropy. We obtain several other refined structural and spectral results, one consequence of which is that the Archimedean characters are the only pretentious multiplicative functions that have Furstenberg systems with trivial rational spectrum, another is that a pretentious multiplicative function has ergodic Furstenberg systems if and only if it pretends to be a Dirichlet character, and a last one is that for any fixed pretentious multiplicative function, all its Furstenberg systems are isomorphic. We also study structural properties of Furstenberg systems of a class of multiplicative functions, introduced by Matomäki, Radziwiłł, and Tao, which lie in the intermediate zone between pretentiousness and strong aperiodicity. In a work of the last two authors and Gomilko, several examples of this class with exotic ergodic behavior were identified, and here we complement this study and discover some new unexpected phenomena. Lastly, we prove that Furstenberg systems of general bounded multiplicative functions have divisible spectrum. When these systems are obtained using logarithmic averages, we show that a trivial rational spectrum implies a strong dilation invariance property, called strong stationarity, but, quite surprisingly, this property fails when the systems are obtained using Cesàro averages.
In this article, we establish a function field analog of Jacobi’s theorem on sums of squares and analyze its moments. Our approach involves employing two distinct techniques to derive the main results concerning asymptotic formulas for the moments. The first technique utilizes Dirichlet series framework to derive asymptotic formulas in the limit of large finite fields, specifically when the characteristic of $\mathbb {F}_q[T]$ becomes large. The second technique involves effectively partitioning the set of polynomials of a fixed degree, providing asymptotic formulas in the limit of large polynomial degree.
We study a certain class of arithmetic functions that appeared in Klurman’s classification of $\pm 1$ multiplicative functions with bounded partial sums; c.f., Comp. Math. 153(2017), 2017, no. 8, 1622–1657. These functions are periodic and $1$-pretentious. We prove that if $f_1$ and $f_2$ belong to this class, then $\sum _{n\leq x}(f_1\ast f_2)(n)=\Omega (x^{1/4})$. This confirms a conjecture by the first author. As a byproduct of our proof, we studied the correlation between $\Delta (x)$ and $\Delta (\theta x)$, where $\theta $ is a fixed real number. We prove that there is a nontrivial correlation when $\theta $ is rational, and a decorrelation when $\theta $ is irrational. Moreover, if $\theta $ has a finite irrationality measure, then we can make it quantitative this decorrelation in terms of this measure.
Given an integer $k\ge 2$, let $\omega _k(n)$ denote the number of primes that divide n with multiplicity exactly k. We compute the density $e_{k,m}$ of those integers n for which $\omega _k(n)=m$ for every integer $m\ge 0$. We also show that the generating function $\sum _{m=0}^\infty e_{k,m}z^m$ is an entire function that can be written in the form $\prod _{p} \bigl (1+{(p-1)(z-1)}/{p^{k+1}} \bigr )$; from this representation we show how to both numerically calculate the $e_{k,m}$ to high precision and provide an asymptotic upper bound for the $e_{k,m}$. We further show how to generalize these results to all additive functions of the form $\sum _{j=2}^\infty a_j \omega _j(n)$; when $a_j=j-1$ this recovers a classical result of Rényi on the distribution of $\Omega (n)-\omega (n)$.