Irregularities in the Distribution of Irreducible Polynomials (Q4032495)

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 149831
Language Label Description Also known as
default for all languages
No label defined
    English
    Irregularities in the Distribution of Irreducible Polynomials
    scientific article; zbMATH DE number 149831

      Statements

      0 references
      1 April 1993
      0 references
      distribution of irreducible polynomials
      0 references
      finite fields
      0 references
      Irregularities in the Distribution of Irreducible Polynomials (English)
      0 references
      The author adapts a method of Erdős and Rankin in the theory of prime numbers to prove the following result about polynomials over \(GF(q)\): for every \(\varepsilon>0\), there exist infinitely many integers \(n\) and polynomials \(f\in GF(q)[x]\) of degree \(n\) such that \(f+g\) is reducible for all \(g\in GF(q)[x]\) with \[ \deg q\leq\log n+\log\log n-2\log\log\log n+(1-\varepsilon)\log\log\log\log n, \] where log denotes the logarithm to base \(q\).
      0 references

      Identifiers