Orthogonal systems in vector spaces over finite fields
We prove that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors.
math.CO↗
arXiv subjects
Steve Senger
Publications and source records attributed to Steve Senger.
Distance graphs in vector spaces over finite fields, coloring and pseudo-randomness
In this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance graphs and show that sufficiently large subsets of $d$-dimensional vector spaces over finite fields contain every possible finite configurations.
math.CO↗