Upper bounds on pairs of dot products

zbMATH Open1386.51005arXiv1502.01729MaRDI QIDQ4604138FDOQ4604138

Authors: Daniel J. Barker, Steven Senger 

Publication date: 23 February 2018

Abstract: Given a large finite point set, $Psubsetmathbb{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 ${\displaystyle }$left{(p,q,r)in P imes P imes P : p cdot q = alpha, p cdot r = �eta ight}.${\displaystyle }$

Full work available at URL: https://arxiv.org/abs/1502.01729

Recommendations

• Pairs of dot products in finite fields and rings
• Convexity, superquadratic growth, and dot products
• The number of extreme triples of a planar point set
• Nearly Equal Distances in the Plane
• Dot-product sets and simplices over finite rings

zbMATH Keywords

upper boundminimal distanceplane points

Mathematics Subject Classification ID

Combinatorial geometries and geometric closure systems (51D20) Inequalities and extremum problems in real or complex geometry (51M16)

Cited In (5)

• Bounds on Point Configurations Determined by Distances and Dot Products
• An upper bound on conductors for pairs
• Pairs of dot products in finite fields and rings
• On the number of dot product chains in finite fields and rings
• Convexity, superquadratic growth, and dot products

This page was built for publication: Upper bounds on pairs of dot products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604138)