A polynomial analogue of Landau's theorem and related problems
arXiv:1603.02890 · doi:10.1112/S0025579317000092
Abstract
Recently, an analogue over of Landau's theorem on sums of two squares was considered by Bary-Soroker, Smilansky and Wolf. They counted the number of monic polynomials in of degree of the form , which we denote by . They studied in two limits: fixed and large ; and fixed and large . We generalize their result to the most general limit . More precisely, we prove \begin{equation*} B(n,q) \sim K_q \cdot \binom{n-\frac{1}{2}}{n} \cdot q^n , \qquad q^n \to \infty, \end{equation*} for an explicit constant . Our methods are different and are based on giving explicit bounds on the coefficients of generating functions. These methods also apply to other problems, related to polynomials with prime factors of even degree.
Incorporated comments from referees. Accepted for publication in Mathematika
Cited by in corpus (6)
- The variance of the number of sums of two squares in in short intervals
- Chebotarev density theorem in short intervals for extensions of
- Conjugacy classes of derangements in finite groups of Lie type
- Uniform estimates for almost primes over finite fields
- On the mean value of the functions related to the divisor function on the ring of polynomials over a finite field
- A geometric approach to counting norms in cyclic extensions of function fields