Dickson polynomials

Enlarge text Shrink text
  • Topic
| מספר מערכת 987007534502805171
Information for Authority record
Name (Hebrew)
פולינומי דיקסון
Name (Latin)
Dickson polynomials
See Also From tracing topical name
Chebyshev polynomials
MARC
MARC
Other Identifiers
Wikidata: Q5273815
Library of congress: sh 92005087
Sources of Information
  • Work cat.: 92-30842: Lidl, R. Dickson polynomials, 1992(... related to the classical Chebyshev polynomials ... introductory letter)
Wikipedia description:

In mathematics, the Dickson polynomials, denoted Dn(x,α), form a polynomial sequence introduced by L. E. Dickson (1897). They were rediscovered by Brewer (1961) in his study of Brewer sums and have at times, although rarely, been referred to as Brewer polynomials. Over the complex numbers, Dickson polynomials are essentially equivalent to Chebyshev polynomials with a change of variable, and, in fact, Dickson polynomials are sometimes called Chebyshev polynomials. Dickson polynomials are generally studied over finite fields, where they sometimes may not be equivalent to Chebyshev polynomials. One of the main reasons for interest in them is that for fixed α, they give many examples of permutation polynomials; polynomials acting as permutations of finite fields.

Read more on Wikipedia >