Note on the number of hinges defined by a point set in R^2

DOI10.1007/S00493-020-4171-4MaRDI QIDQ2658385zbMATH OpenOpenAlexFDO

Authors Misha Rudnev

Publication date 20 March 2021

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-020-4171-4

zbMATH Keywords

distinct distanceshingepoint configurations

Mathematics Subject Classification ID

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

Review text

Let be given \(n\) points in the Eucidean plane. A \textit{hinge} is a multiset of two distances measured among some 3 of the \(n\) point. There are at most \(3\binom{n}{3} \) distinct hinges. What is the minimum number of distinct hinges in sets of \(n\) points? This problem was first raised by \textit{A. Iosevich} and \textit{J. Passant} [Proc. Steklov Inst. Math. 303, 129--139 (2018; Zbl 1414.05101); translation in Tr. Mat. Inst. Steklova 303, 142--154 (2018)]. If the points make a \(\sqrt{n}\times \sqrt{n}\) grid, there are about \(cn^2/\log n\) hinges with some constant \(c>0\). The paper under review shows that the number of hinges is always at least \(cn^2/\log^3 n\), which only a \(\log^2 n\) factor off the grid construction mentioned. The proof heavily uses the methods of \textit{L. Guth} and \textit{N. H. Katz} [Ann. Math. (2) 181, No. 1, 155--190 (2015; Zbl 1310.52019)], which made a breakthrough on the Erdős distance problem.

Recommendations

• Bisectors and pinned distances
• On the sum of the squared multiplicities of the distances in a point set over finite spaces
• Incidences in three dimensions and distinct distances in the plane
• Distinct distances in homogeneous sets in Euclidean space
• Incidences in three dimensions and distinct distances in the plane

Cites work

• Embedding distance graphs in finite field vector spaces
• Finite point configurations in the plane, rigidity and Erdős problems
• Incidences between points and lines on two- and three-dimensional varieties
• Incidences in three dimensions and distinct distances in the plane
• On Sets of Distances of n Points
• On the Erdős distinct distances problem in the plane
• On the number of incidences between points and planes in three dimensions
• On the use of the Klein quadric for geometric incidence problems in two dimensions

Cited in

(4)

• Angle chains and pinned variants
• On the number of discrete chains
• On Erdős chains in the plane
• Distribution of pinned distance trees in the plane \(\mathbb{F}_p^2\)

This page was built for publication: Note on the number of hinges defined by a point set in \(\mathbb{R}^2\)

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