Pairs of dot products in finite fields and rings
Combinatorics
2015-08-12 v1
Abstract
We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given or , we provide bounds on the size of the set for units and .
Cite
@article{arxiv.1508.02691,
title = {Pairs of dot products in finite fields and rings},
author = {David Covert and Steven Senger},
journal= {arXiv preprint arXiv:1508.02691},
year = {2015}
}