On the number of hinges defined by a point set in \mathbb R^2

arXiv1902.05791MaRDI QIDQ6314101FDOQ6314101

Misha Rudnev

Publication date: 15 February 2019

Abstract: It is shown that the number of distinct types of three-point hinges, defined by a real plane set of $n$ points is $gg{n}^{2}lo{g}^{-3}n$, where a hinge is identified by fixing two pair-wise distances in a point triple. This is achieved via strengthening (modulo a $logn$ factor) of the Guth-Katz estimate for the number of pair-wise intersections of lines in $mathbb{R}^3$, arising in the context of the plane ErdH os distinct distance problem, to a second moment incidence estimate. This relies, in particular, on the generalisation of the Guth-Katz incidence bound by Solomon and Sharir.

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Other combinatorial number theory (11B75)

This page was built for publication: 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 Q6314101)