Le Anh Vinh
Published 2008-07-17Version 1
Iosevich and Senger (2008) showed 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. In this note, we provide a graph theoretic proof of this result.
Orthogonal systems in vector spaces over finite fields
On the minimum rank of a graph over finite fields
Pairs of dot products in finite fields and rings
![QR code for arXiv:0807.2690 [math.CO]](http://oss.arxitics.com/images/favicon.svg)