Article ID Journal Published Year Pages File Type
4656066 Journal of Combinatorial Theory, Series A 2009 20 Pages PDF
Abstract

We consider point sets in the m-dimensional affine space where each squared Euclidean distance of two points is a square in Fq. It turns out that the situation in 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 . 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 Gm,q with vertex set . It turns out that Gm,q is strongly regular for some cases.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics