On the number of discrete chains

DOI10.1090/proc/15603zbMath1475.52029arXiv1902.08259OpenAlexW3159678796MaRDI QIDQ5157810

Adam Sheffer, Steven Senger, Eyvindur Ari Palsson

Publication date: 20 October 2021

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

incidencesunit distance problem

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Configuration theorems in linear incidence geometry (51A20)

Related Items (3)

Angle chains and pinned variants ⋮ On the number of dot product chains in finite fields and rings ⋮ Reviews

Cites Work

• Unnamed Item
• Unnamed Item
• Finite chains inside thin subsets of \(\mathbb{R}^d\)
• The number of unit distances is almost linear for most norms
• Extremal problems in discrete geometry
• Cutting circles into pseudo-segments and improved bounds for incidences
• Zur Zerlegung von Punktmengen in solche kleineren Durchmessers
• Note on the number of hinges defined by a point set in \(\mathbb{R}^2\)
• Unit Distances in Three Dimensions
• Research Problems in Discrete Geometry
• Breaking the 3/2 Barrier for Unit Distances in Three Dimensions
• An improved bound on the number of point-surface incidences in three dimensions
• On Sets of Distances of n Points

This page was built for publication: On the number of discrete chains