Upper bounds on pairs of dot products

preprint2015arXivOpen access

Abstract

Given a large finite point set, P⊂R2P\subset \mathbb R^2, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, (α,β)(α, β), we bound the size of the set {(p,q,r)∈P×P×P:p⋅q=α,p⋅r=β}.\left\{(p,q,r)\in P \times P \times P : p \cdot q = α, p \cdot r = β\right\}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.