On the number of orthogonal systems in vector spaces over finite fields
| dc.creator | Vinh, Le Anh | |
| dc.date | 2008-07-17 | |
| dc.date.accessioned | 2026-07-07T09:50:55Z | |
| dc.date.available | 2026-07-07T09:50:55Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0807.2690 | |
| dc.identifier | http://arxiv.org/abs/0807.2690 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/165113 | |
| dc.subject | Combinatorics | |
| dc.title | On the number of orthogonal systems in vector spaces over finite fields | |
| dc.type | text |