THE MAXIMAL ORDER OF ITERATED MULTIPLICATIVE FUNCTIONS

From MaRDI portal
Publication:5227718

DOI10.1112/S0025579319000214zbMATH Open1443.11198arXiv1709.04799OpenAlexW3098701199MaRDI QIDQ5227718FDOQ5227718


Authors: Christian Elsholtz, Marc Technau, Niclas Technau Edit this on Wikidata


Publication date: 7 August 2019

Published in: Mathematika (Search for Journal in Brave)

Abstract: Following Wigert, various authors, including Ramanujan, Gronwall, ErdH{o}s, Ivi'{c}, Schwarz, Wirsing, and Shiu, determined the maximal order of several multiplicative functions, generalizing Wigert's result max_{nleq x} log d(n) = frac{log x}{log log x} (log 2 + o(1)). On the contrary, for many multiplicative functions, the maximal order of iterations of the functions remains widely open. The case of the iterated divisor function was only solved recently, answering a question of Ramanujan from 1915. Here we determine the maximal order of logf(f(n)) for a class of multiplicative functions f. In particular, this class contains functions counting ideals of given norm in the ring of integers of an arbitrary, fixed quadratic number field. As a consequence, we determine such maximal orders for several multiplicative f arising as a normalized function counting representations by certain binary quadratic forms. Incidentally, for the non-multiplicative function r2 which counts how often a positive integer is represented as a sum of two squares, this entails the asymptotic formula max_{nleq x} log r_2(r_2(n))= frac{sqrt{log x}}{log log x} (c/sqrt{2}+o(1)) with some explicitly given constant c>0.


Full work available at URL: https://arxiv.org/abs/1709.04799




Recommendations




Cites Work


Cited In (9)





This page was built for publication: THE MAXIMAL ORDER OF ITERATED MULTIPLICATIVE FUNCTIONS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227718)