(2n,2n,2n,1)-relative difference sets and their representations
Abstract
We show that every (2n,2n,2n,1)-relative difference set D in 4n relative to 2n can be represented by a polynomial f(x)∈ 2n[x], where f(x+a)+f(x)+xa is a permutation for each nonzero a. We call such an f a planar function on 2n. The projective plane obtained from D in the way of Ganley and Spence ganleyrelative1975 is coordinatized, and we obtain necessary and sufficient conditions of to be a presemifield plane. We also prove that a function f on 2n with exactly two elements in its image set and f(0)=0 is planar, if and only if, f(x+y)=f(x)+f(y) for any x,y∈2n.
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.