English

(2^n,2^n,2^n,1)-relative difference sets and their representations

Combinatorics 2013-04-16 v2

Abstract

We show that every (2n,2n,2n,1)(2^n,2^n,2^n,1)-relative difference set DD in Z4n\Z_4^n relative to Z2n\Z_2^n can be represented by a polynomial f(x)\F2n[x]f(x)\in \F_{2^n}[x], where f(x+a)+f(x)+xaf(x+a)+f(x)+xa is a permutation for each nonzero aa. We call such an ff a planar function on \F2n\F_{2^n}. The projective plane Π\Pi obtained from DD in the way of Ganley and Spence \cite{ganley_relative_1975} is coordinatized, and we obtain necessary and sufficient conditions of Π\Pi to be a presemifield plane. We also prove that a function ff on \F2n\F_{2^n} with exactly two elements in its image set and f(0)=0f(0)=0 is planar, if and only if, f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y) for any x,y\F2nx,y\in\F_{2^n}.

Keywords

Cite

@article{arxiv.1211.2942,
  title  = {(2^n,2^n,2^n,1)-relative difference sets and their representations},
  author = {Yue Zhou},
  journal= {arXiv preprint arXiv:1211.2942},
  year   = {2013}
}
R2 v1 2026-06-21T22:37:26.907Z