Angle chains and pinned variants
From MaRDI portal
Publication:5028451
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 points , and a sequence of angles , we give upper and lower bounds on the maximum possible number of tuples of distinct points satisfying for every as well as pinned analogues.
Recommendations
Cites work
- scientific article; zbMATH DE number 2145235 (Why is no real title available?)
- scientific article; zbMATH DE number 3893918 (Why is no real title available?)
- Bounds on Point Configurations Determined by Distances and Dot Products
- Breaking the 3/2 Barrier for Unit Distances in Three Dimensions
- Extremal problems in discrete geometry
- Finite chains inside thin subsets of \(\mathbb{R}^d\)
- Long paths in the distance graph over large subsets of vector spaces over finite fields
- Note on the number of hinges defined by a point set in \(\mathbb{R}^2\)
- On Erdős chains in the plane
- On Sets of Distances of n Points
- On the Erdős distinct distances problem in the plane
- On the number of discrete chains
- Repeated Angles in Three and Four Dimensions
- Repeated angles in the plane and related problems
- The Erdős distance problem
Cited in
(4)
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)