Angle chains and pinned variants

From MaRDI portal
Publication:5028451

zbMATH Open1482.52018arXiv2104.09960MaRDI QIDQ5028451FDOQ5028451


Authors: Eyvindur Ari Pallson, Steven Senger, Charles Wolf Edit this on Wikidata


Publication date: 9 February 2022

Abstract: We study a variant of the ErdH os unit distance problem, concerning angles between successive triples of points chosen from a large finite point set. Specifically, given a large finite set of n points E, and a sequence of angles (alpha1,ldots,alphak), we give upper and lower bounds on the maximum possible number of tuples of distinct points (x1,dots,xk+2)inEk+2 satisfying angle(xj,xj+1,xj+2)=alphaj for every 1lejlek as well as pinned analogues.


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




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Angle chains and pinned variants

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