On the number of slopes of the graph of a function defined on a finite field
Journal of Combinatorial Theory Series A
There Are Integral Heptagons, no Three Points on a Line, no Four on a Circle
Discrete & Computational Geometry
Discrete Applied Mathematics
| Hi-index | 0.01 |
We consider point sets in the m-dimensional affine space F"q^m where each squared Euclidean distance of two points is a square in F"q. It turns out that the situation in F"q^m is rather similar to the one of integral distances in Euclidean spaces. Therefore we expect the results over finite fields to be useful for the Euclidean case. We completely determine the automorphism group of these spaces which preserves integral distances. For some small parameters m and q we determine the maximum cardinality I(m,q) of integral point sets in F"q^m. We provide upper bounds and lower bounds on I(m,q). If we map integral distances to edges in a graph, we can define a graph G"m","q with vertex set F"q^m. It turns out that G"m","q is strongly regular for some cases.