Dot Product Chains
Abstract
We study a variant of Erd?s’ unit distance problem, concerning dot products between successive pairs of points chosen from a large finite point set. Specifically, given a large finite set of n points E, and a sequence of nonzero dot products (?1, …, ?k), we give upper and lower bounds on the maximum possible number of tuples of distinct points (A1, …, Ak+1) ? Ek+1 satisfying Aj · Aj+1 = ?j for every 1 ? j ? k.
Department(s)
Mathematics
Document Type
Article
DOI
10.5281/zenodo.11352877
Publication Date
1-1-2024
Recommended Citation
Kilmer, Shelby; Senger, Steven; and Marshall, Caleb, "Dot Product Chains" (2024). Faculty Scholarship. 466.
https://bearworks.missouristate.edu/articles00/466
Journal Title
Integers
COinS
