Dot product chains
Abstract
We study a variant of Erdos' 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
Conference Proceeding
DOI
10.1515/9783111395593-013
Publication Date
10-15-2024
Recommended Citation
Kilmer, Shelby; Marshall, Caleb; and Senger, Steven, "Dot product chains" (2024). Faculty Scholarship. 314.
https://bearworks.missouristate.edu/articles00/314
Journal Title
De Gruyter Proceedings in Mathematics
COinS
