Highly composite polynomials and the maximum order of the divisor function in \(\mathbb{F}_q [t]\) (Q2052860): Difference between revisions

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.