Two types of permutation polynomials with special forms (Q1734660)

From MaRDI portal
Revision as of 06:43, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Two types of permutation polynomials with special forms
scientific article

    Statements

    Two types of permutation polynomials with special forms (English)
    0 references
    0 references
    0 references
    0 references
    27 March 2019
    0 references
    Let $q$ be a power of a prime. Let $\mathbb{F}_q$ be a finite field with $q$ elements. We denote the set of units in $\mathbb{F}_q$ by $\mathbb{F}_q^\ast$. A polynomial $f(x)\in \mathbb{F}_q[x]$ is called a permutation polynomial if the map $f: \mathbb{F}_q\to\mathbb{F}_q, ~c\to f(c)$ is a bijection. In this paper, the authors construct four families of infinite classes of permutation trinomials over $\mathbb{F}_{q^2}$ with the following form \[ cx-x^s+x^{qs},\] where $s$ is a positive integer and $c\in \mathbb{F}_{q^2}$. The proofs involve a result due to \textit{Y. H. Park} and \textit{J. B. Lee} [Bull. Aust. Math. Soc. 63, No. 1, 67--74 (2001; Zbl 0981.11039)], a symbolic computation method related to Gröbner bases and resultants.
    0 references
    finite field
    0 references
    permutation polynomial
    0 references
    symbolic computation
    0 references

    Identifiers