The number of directions determined by a function f on a finite field
Journal of Combinatorial Theory Series A
On the number of slopes of the graph of a function defined on a finite field
Journal of Combinatorial Theory Series A
On a Generalization of Rédei’s Theorem
Combinatorica
On the graph of a function in two variables over a finite field
Journal of Algebraic Combinatorics: An International Journal
Journal of Combinatorial Theory Series A
Maximum distance separable codes and arcs in projective spaces
Journal of Combinatorial Theory Series A
On the number of directions determined by a pair of functions over a prime field
Journal of Combinatorial Theory Series A
On small blocking sets and their linearity
Journal of Combinatorial Theory Series A
On the graph of a function over a prime field whose small powers have bounded degree
European Journal of Combinatorics
On the maximality of linear codes
Designs, Codes and Cryptography
Constructing permutations of finite fields via linear translators
Journal of Combinatorial Theory Series A
Complete arcs on the parabolic quadric Q (4,q)
Finite Fields and Their Applications
Vandermonde sets and super-Vandermonde sets
Finite Fields and Their Applications
The number of directions determined by less than q points
Journal of Algebraic Combinatorics: An International Journal
Hi-index | 0.00 |
A proof is presented that shows that the number of directions determined by a function over a finite field GF(q) is either 1, at least (q + 3)/2, or between q/s + 1 and (q - 1)/(s - 1) for some s where GF(s) is a subfield of GF(q). Moreover, the graph of those functions that determine less than half the directions is GF(s)-linear. This completes the unresolved cases s = 2 and 3 of the main theorem in Blokhuis et al. (J. Combin. Theory Ser. A 86 (1999) 187).