Exceptional polynomials over finite fields (Q1897201): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Q189407 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Richard A. Mollin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/ffta.1995.1022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048921385 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:35, 19 March 2024

scientific article
Language Label Description Also known as
English
Exceptional polynomials over finite fields
scientific article

    Statements

    Exceptional polynomials over finite fields (English)
    0 references
    0 references
    0 references
    19 June 1996
    0 references
    The key breakthrough in the attempts to eliminate candidates for the monodromy groups of an indecomposable exceptional polynomial is generally considered to be the work of Fried et al. in 1993. However, they employed the classification of finite simple groups, among other things. The authors of the paper under review remedy this situation by confirming the monodromy group of all polynomials of a certain type, independent of the aforementioned classification. The authors dedicate the paper (``with gratitude and appreciation'') to Leonard Carlitz about whom they comment, in text, that ``Carlitz would have been satisfied that his insight into the nature of PP's (permutation polynomials) has had such deep consequences \(\dots\)''.
    0 references
    finite field
    0 references
    permutation polynomials
    0 references
    indecomposable exceptional polynomial
    0 references
    monodromy group
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references