Abstract

Let Fq\Bbb F_q be a finite field with char Fq=p\text{char}\,\Bbb F_q=p and n>0n>0 an integer with gcd(n,log⁡pq)=1\text{gcd}(n, \log_pq)=1. Let ( )∗:Fq(x0,…,xn−1)→Fq(x0,…,xn−1)(\ )^*:\Bbb F_q({\tt x}_0,\dots,{\tt x}_{n-1})\to\Bbb F_q({\tt x}_0,\dots,{\tt x}_{n-1}) be the Fq\Bbb F_q-monomorphism defined by xi∗=xi+1{\tt x}_i^*={\tt x}_{i+1} for 0≤i<n−10\le i< n-1 and xn−1∗=x0q{\tt x}_{n-1}^*={\tt x}_0^q. For f,g∈Fq(x0,…,xn−1)∖Fqf,g\in\Bbb F_q({\tt x}_0,\dots,{\tt x}_{n-1})\setminus\Bbb F_q, define f∘g=f(g,g∗,…,g(n−1)∗)f\circ g=f(g,g^*,\dots,g^{(n-1)*}). Then (Fq(x0,…,xn−1)∖Fq, ∘)(\Bbb F_q({\tt x}_0,\dots,{\tt x}_{n-1})\setminus\Bbb F_q,\,\circ) is a monoid whose invertible elements are called global P\mathcal P-forms. Global P\mathcal P-forms were first introduced by H. Dobbertin in 2001 with q=2q=2 to study certain type of permutation polynomials of F2m\Bbb F_{2^m} with gcd(m,n)=1\text{gcd}(m,n)=1; global P\mathcal P-forms with q=pq=p for an arbitrary prime pp were considered by W. More in 2005. In this paper, we discuss some fundamental questions about global P\mathcal P-forms, some of which are answered and others remain open.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.