A general representation theory for constructing groups of permutation polynomials

DOI10.1016/J.FFA.2015.03.006zbMath1343.11091OpenAlexW251066164MaRDI QIDQ491994

Robert S. Coulter, Chris Castillo

Publication date: 19 August 2015

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2015.03.006

zbMATH Keywords

finite fieldregular representationpermutation polynomialequivalent representations

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06)

Related Items (1)

COORDINATISING PLANES OF PRIME POWER ORDER USING FINITE FIELDS

Cites Work

• Permutation polynomials of the form \(x^r f(x^{(q-1)/d)}\) and their group structure
• When Does a Polynomial Over a Finite Field Permute the Elements of the Field?
• Polynomials and linear transformations over finite fields.
• Permutation Properties of the Polynomials 1 + x + ⋯+ x k Over a Finite Field
• Permutations in a finite field
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A general representation theory for constructing groups of permutation polynomials