z-logo
Premium
( 2 n , 2 n , 2 n , 1 ) ‐Relative Difference Sets and Their Representations
Author(s) -
Zhou Yue
Publication year - 2013
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.21349
Subject(s) - mathematics , combinatorics , permutation (music) , plane (geometry) , projective plane , planar , set (abstract data type) , function (biology) , polynomial , discrete mathematics , geometry , mathematical analysis , physics , computer graphics (images) , evolutionary biology , computer science , acoustics , correlation , biology , programming language
We show that every ( 2 n , 2 n , 2 n , 1 ) ‐relative difference set D in Z 4 n relative to Z 2 n can be represented by a polynomial f ( x ) ∈ F 2 n[ x ] , where f ( x + a ) + f ( x ) + x a is a permutation for each nonzero a . We call such an f a planar function on F 2 n . The projective plane Π obtained from D in the way of M. J. Ganley and E. Spence (J Combin Theory Ser A, 19(2) (1975), 134–153) is coordinatized, and we obtain necessary and sufficient conditions of Π to be a presemifield plane. We also prove that a function f on F 2 nwith 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 ∈ F 2 n.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom