TOPICS
Search

o-Polynomial


An o-polynomial over a finite field F_q of even order q>=4 is a polynomial h of degree at most q-1 inducing a permutation of F_q, with h(0)=0 and h(1)=1, such that for every s in F_q the map

 h_s(z)={(h(s+z)+h(s))/z   if z!=0;; 0   if z=0
(1)

is also a permutation of F_q. This is the normalized convention. For example, h(X)=X^2 is an o-polynomial.

The points (1:x:h(x)), for x in F_q, together with (0:1:0) and (0:0:1) form a hyperoval in the projective plane over F_q. This relates these polynomials to deep holes of dimension-two Reed-Solomon codes (Chen and Huang 2026).


See also

Hyperoval, Permutation Polynomial

Explore with Wolfram|Alpha

References

Chen, B. and Huang, J. "Deep Holes of Full-Length Reed-Solomon Codes." 21 Oct 2026. https://arxiv.org/abs/2610.29429.Hirschfeld, J. W. P. Projective Geometries over Finite Fields, 2nd ed. Oxford, England: Clarendon Press, 1998. https://doi.org/10.1093/oso/9780198502951.001.0001.

Cite this as:

Weisstein, Eric W. "o-Polynomial." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/o-Polynomial.html

Subject classifications