6 papers · 1 filter
Distinct Angle Problems and Variants
Henry L. Fleischmann, Hongyi B. Hu, Faye Jackson +4
The Erdős distinct distance problem is a ubiquitous problem in discrete geometry. Less well known is Erdős' distinct angle problem, the problem of finding the minimum number of dis…
Angle chains and pinned variants
Eyvindur Ari Palsson, Steven Senger, Charles Wolf
We study a variant of the Erd\H os unit distance problem, concerning angles between successive triples of points chosen from a large finite point set. Specifically, given a large f…
Bounds on point configurations determined by distances and dot products
Slade Gunter, Eyvi Palsson, Ben Rhodes +1
We study a family of variants of Erd\H os' unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically,…
Characterizing optimal point sets determining one distinct triangle
Hazel N. Brenner, James S. Depret-Guillaume, Eyvindur A. Palsson +1
In this paper we determine the maximum number of points in which form exactly distinct triangles, where we restrict ourselves to the case of . We denote t…
Crescent configurations in normed spaces
Sara Fish, Dylan King, Steven J. Miller +2
We study the problem of crescent configurations, posed by Erdős in 1989. A crescent configuration is a set of points in the plane such that: 1) no three points lie on a common…
On the Number of Discrete Chains
Eyvindur Ari Palsson, Steven Senger, Adam Sheffer
We study a generalization of Erd\H os's unit distances problem to chains of distances. Given a set of points, and a sequence of distances ,…