Reducibility of translates of Dickson polynomials (Q4383082)

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 1132344
Language Label Description Also known as
default for all languages
No label defined
    English
    Reducibility of translates of Dickson polynomials
    scientific article; zbMATH DE number 1132344

      Statements

      Reducibility of translates of Dickson polynomials (English)
      0 references
      24 March 1998
      0 references
      Dickson polynomials
      0 references
      Chebyshev polynomials
      0 references
      binomials
      0 references
      reducibility
      0 references
      Vahlen-Capelli criterion
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      Let \(K\) be a field and \(a,b\in K\). The Dickson polynomial \(D_n(x,a)\) is characterized by the equation \[ D_n(x+a/x,a) =x^n+ (a/x)^n. \] The main result of this paper is that \(D_n(x,a) +b\in K[x]\) is reducible if and only if there is a prime \(p\) dividing \(n\) such that \(b= -D_p (c,a^{n/p})\) for some \(c\in K\), or \(n=4k\) and \(b=4c^4- 8a^kc^2 +2a^{2k}\) for some \(c\in K\). On putting \(a=0\) in this result and noting that \(D_n(x,a) =x^n\), it reduces to the well-known Vahlen-Capelli criterion for the reducibility of binomials.
      0 references

      Identifiers