On Global P-Forms

Abstract

Let Fq be a finite field with char\, Fq=p and n>0 an integer with gcd(n, pq)=1. Let (\ )*: Fq( x0,…, xn-1) Fq( x0,…, xn-1) be the Fq-monomorphism defined by xi*= xi+1 for 0 i< n-1 and xn-1*= x0q. For f,g∈ Fq( x0,…, xn-1) Fq, define f g=f(g,g*,…,g(n-1)*). Then ( Fq( x0,…, xn-1) Fq,\,) is a monoid whose invertible elements are called global P-forms. Global P-forms were first introduced by H. Dobbertin in 2001 with q=2 to study certain type of permutation polynomials of F2m with gcd(m,n)=1; global P-forms with q=p for an arbitrary prime p were considered by W. More in 2005. In this paper, we discuss some fundamental questions about global P-forms, some of which are answered and others remain open.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…