Angle chains and pinned variants
From MaRDI portal
Publication:5028451
zbMATH Open1482.52018arXiv2104.09960MaRDI QIDQ5028451FDOQ5028451
Authors: Eyvindur Ari Pallson, Steven Senger, Charles Wolf
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 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.
Full work available at URL: https://arxiv.org/abs/2104.09960
Recommendations
Erd?s problems and related topics of discrete geometry (52C10) Configuration theorems in linear incidence geometry (51A20)
Cites Work
- On the Erdős distinct distances problem in the plane
- Repeated angles in the plane and related problems
- On Sets of Distances of n Points
- Extremal problems in discrete geometry
- Finite chains inside thin subsets of \(\mathbb{R}^d\)
- Title not available (Why is that?)
- The Erdős distance problem
- Title not available (Why is that?)
- Repeated Angles in Three and Four Dimensions
- Breaking the 3/2 Barrier for Unit Distances in Three Dimensions
- On the number of discrete chains
- 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\)
- Bounds on Point Configurations Determined by Distances and Dot Products
- On Erd\H{o}s Chains in the Plane
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)