The least common multiple of polynomial values over function fields (Q7030668)

Letting \(\textrm{lcm}\) to be the least common multiplier, the asymptotic \(\log\textrm{lcm}\left(1 ,\ldots, N\right) \sim N\) as \(N\to\infty\) is equivalent to the prime number theorem. For a linear polynomial \(f(X) = k X + h,\ k,h\in\mathbb{Z}\) with \(k, h+k>0\) it was observed [\textit{P. Bateman} et al., Am. Math. Mon. 109, No. 4, 393--394 (2002; Zbl 1124.11300)] that the Prime Number Theorem for arithmetic progressions implies\N\[\N\log\textrm{lcm}\left(f\left(1\right) ,\ldots, f\left(N\right)\right) \sim \left(\frac{k}{\varphi(k)} \sum_{\substack{1 \leq m \leq k\\\N(m,k) = 1}} \frac{1}{m}\right) N.\N\]\NFor the polynomials \(f\) with degree \(d\geq 2\) several results are known concerning \(\textrm{lcm}\left(f\left(1\right) ,\ldots, f\left(N\right)\right)\). In the present paper, the authors consider the function field analogue of the problem, by approximating the quantity \(\deg L_f(n)\), where\N\[\NL_f(n) := \mathrm{lcm} \left(f\left(Q\right): Q \in \mathbb{F}_q[T] \text{ monic}, \deg Q = n\right),\N\]\Nwhere \(q=p^n\) is a power of prime, \(f\in\mathbb{F}_q[T][X]\) is a polynomial of degree \(d\geq 1\) of the form \(f(X) = f_d X^d + \cdots + f_0\) with \(f_i\in\mathbb{F}_q[T]\).