Solution to a problem of S. Payne (Q4429700)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1986369
Language Label Description Also known as
default for all languages
No label defined
    English
    Solution to a problem of S. Payne
    scientific article; zbMATH DE number 1986369

      Statements

      Solution to a problem of S. Payne (English)
      0 references
      0 references
      28 September 2003
      0 references
      finite field
      0 references
      linearized polynomial
      0 references
      permutation polynomial
      0 references
      Let \(q\) be a prime power. Consider the finite field \(F = \text{GF}(q)\) with \(q\) elements and its \(n\)-dimensional extension field \(K = \text{GF} (q^n)\). For an \(F\)-linear map \(f: K \rightarrow K\), one says that \(f (x)/x\) is a permutation of \(K^\ast/F^\ast\) if given any \(\alpha \in K^\ast\), there is some \(\beta \in K^\ast\) such that \(f (\beta) / \beta = t \alpha\) for some \(t \in F^\ast\). In the paper under review the author determines all linearized polynomials \(f (x) \in K[x]\) for which \(f(x)\) is a permutation of \(K\) and \(f (x) / x\) is a permutation of \(K^\ast / F^\ast\). The clever proof uses elementary linear algebra, sub-determinants, and the uniqueness of \(q\)-adic expansions. The only solutions are \(f (x) = a x^{q^k}\) for \(a \in K^\ast\) and \((k, n) = 1\). In the special case when \(q = 2\) (so that \(f (x)/x\) is a permutation of \(\text{GF}(2^n)^\ast)\), the author states that this solves an old problem of Stanley Payne, initially posed in terms of hyperovals in \(\text{PG}(2, 2^n)\). In fact, Payne solved his own problem shortly after he posed it [\textit{S. E. Payne}, Atti Acad. Naz. Lincei, (7) Rend., Cl. Sci. Fis. Mat. Nat. 51(1971), 328--331 (1972; Zbl 0238.50018)]. Nonetheless, the generalization to arbitrary \(q\) in the paper under review is very nice.
      0 references

      Identifiers