Abstract
We prove that if q = p h, p a prime, do not exist sets \({U {\subseteq} AG(n,q)}\), with |U| = q k and 1 < k < n, determining N directions where
when q is odd and
when q > 2 is even.
Similar content being viewed by others
References
Ball S.: The number of directions determined by a function over a finite field. J. Comb. Theory. Ser. A 104, 341–350 (2003)
Blokhuis A., Ball S., Brouwer A.E., Storme L., Szönyi T.: On the number of slopes of the graph of a function defined on a finite field. J. Comb. Theory. Ser. A 86, 187–196 (1999)
Gács, A.: Polynomials for higher dimensional problems, Combinatorics 2008 (to appear in Discrete Math.)
Gács, A., Lovász, L., Szönyi, T.: Directions in AG(2, p 2). Innov. Inc. Geom. 6–7, 189–201 (2007–2008)
Hirschfeld J.W.P.: Projective geometries over finite fields, 2nd edn. Oxford Science Publication, Clarendon Press, Oxford (1998)
Lunardon G.: Linear k-blocking sets. Combinatorica 21, 571–581 (2001)
Rédei, L.: Luckenhafte Polynome uber endlichen Korpen, Birkhauser-Verlag, Basel (1970) (English translation: Lacunary polynomials over finite fields), North-Holland, Amsterdam (1973)
Storme L., Sziklai P.: Linear point sets and Rédei type k-blocking sets in PG(n, q). J Algebr Combinatorics 14, 221–228 (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Editor in Chief.
Rights and permissions
About this article
Cite this article
De Vito, P. On the directions problem in AG(n, q). Ricerche mat. 60, 39–43 (2011). https://doi.org/10.1007/s11587-010-0094-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11587-010-0094-5