Degree of Orthomorphism Polynomials over Finite Fields
Combinatorics
2021-07-09 v1 Rings and Algebras
Abstract
An orthomorphism over a finite field is a permutation such that the map is also a permutation of . The degree of an orthomorphism of , that is, the degree of the associated reduced permutation polynomial, is known to be at most . We show that this upper bound is achieved for all prime powers . We do this by finding two orthomorphisms in each field that differ on only three elements of their domain. Such orthomorphisms can be used to construct -homogeneous Latin bitrades.
Cite
@article{arxiv.2103.02153,
title = {Degree of Orthomorphism Polynomials over Finite Fields},
author = {Jack Allsop and Ian M. Wanless},
journal= {arXiv preprint arXiv:2103.02153},
year = {2021}
}