On certain character sums over 𝔽_{𝕒}[𝕋] (Q4383041)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1132302
Language Label Description Also known as
default for all languages
No label defined
    English
    On certain character sums over 𝔽_{𝕒}[𝕋]
    scientific article; zbMATH DE number 1132302

      Statements

      On certain character sums over 𝔽_{𝕒}[𝕋] (English)
      0 references
      0 references
      24 March 1998
      0 references
      Riemann Hypothesis
      0 references
      quadratic nonresidues
      0 references
      primitive roots
      0 references
      ring of polynomials
      0 references
      least degree of a monic irreducible polynomial
      0 references
      function field
      0 references
      character sum estimates
      0 references
      0 references
      0 references
      Let \(\mathbb{F}_q\) be the finite field with \(q\) elements, and let \({\mathcal A}\) denote the ring of polynomials in one variable with coefficients in \(\mathbb{F}_q\). Let \(P\) be a monic polynomial irreducible in \({\mathcal A}\). The author proves that when \(q\) is odd, the least degree of a monic irreducible in \({\mathcal A}\) which is a quadratic nonresidue modulo \(P\) is less than \[ 2+2\log_q (1+\deg P). \] Furthermore he proves that the least degree of a monic irreducible in \({\mathcal A}\) which is a primitive root modulo \(P\) is \[ O(\deg P/\log_q(\deg P)). \] The latter result seems amenable to a refinement involving the number of prime divisors of \((|P|-1)/ (q-1)\) in the light of known analogues of these results in the characteristic zero case; namely, \textit{N. C. Ankeny} [Ann. Math., II. Ser. 55, 65-72 (1952; Zbl 0046.04006)] proved, on the assumption of the extended Riemann hypothesis, that the least positive quadratic nonresidue of the prime \(k\) is \(O((\log k)^2)\) and the least positive root \(\text{mod }k\) is \(O((2^{\nu(k-1)}\log k\log(2^{\nu(k-1)}\log k))^2)\), with \(\nu(k-1)\) the number of different prime divisors of \(k-1\). Indeed, the author proves a comparable result in the function field case provided that \((|P|-1)/(q-1)\) is a prime number. An important ingredient in the proofs is certain character sum estimates due to Effinger and Hayes [see chapter 5, \textit{G. Effinger} and \textit{D. R. Hayes}, Additive number theory of polynomials over a finite field (Clarendon Press, Oxford, 1991; Zbl 0759.11032)].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references