Highly composite polynomials and the maximum order of the divisor function in F_q [t]

DOI10.1007/S11139-020-00299-2MaRDI QIDQ2052860zbMATH OpenOpenAlexFDO

Authors Ardavan Afshar

Publication date 29 November 2021

Published in The Ramanujan Journal (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

arithmetic of polynomials over finite fieldsdivisor functionhighly composite numbers

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Rate of growth of arithmetic functions (11N56) Arithmetic theory of polynomial rings over finite fields (11T55)

Abstract: We investigate the analogues, in $mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too sparse, and we use it to compute the logarithm of the maximum of the divisor function at every degree up to an error of a constant, which is significantly smaller than in the case of the integers, even assuming the Riemann Hypothesis.

Review text

For a positive integer \(n\), let \(d(n)\) be the number of divisors of \(n\). We say an integer \(n\) a \textit{highly composite number} if \(d(n)>d(n')\) for all \(n'<n\). Define \[ D(N):=\max\{d(n)\colon n\le N\}, \] which is equal to \(d(n)\) for the largest highly composite \(n\le N\). The order of \(D(N)\) was studied by [\textit{S. Ramanujan}, Collected papers of Srinivasa Ramanujan. Cambridge: Cambridge University Press (1927; JFM 53.0030.02)]. More precisely, he computed \(\log D(N)\) up to an error of at most \(O(e^{-c\sqrt{\log \log N}}\log N)\) unconditionally, and \(O\left(\frac{\sqrt{\log N}}{(\log \log N)^3}\right)\) under the Riemann Hypothesis. Let \(\mathbb{F}_q\) be the finite field of order \(q\). In this paper, the author investigates the analogues in the setting of \(\mathbb{F}_q[t]\). Theorems \(1\), \(2\), and \(3\) are the main results.

Recommendations

• Highly composite numbers. Annotated by Jean-Louis Nicolas and Guy Robin
• Highly composite numbers and the Riemann hypothesis
• Maximal order of a function linked to the divisors of an integer.
• On large values of the divisor function
• Nombres hautement composés

Cites work

• On Highly Composite and Similar Numbers

Cited in

(1)

• Maximal height of divisors of x^pqb – 1

This page was built for publication: Highly composite polynomials and the maximum order of the divisor function in \(\mathbb{F}_q [t]\)

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