The number of unit-area triangles in the plane: theme and variation

DOI10.1007/S00493-016-3440-8MaRDI QIDQ722324zbMATH OpenOpenAlexFDO

Authors Orit E. Raz, Micha Sharir

Publication date 23 July 2018

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-016-3440-8

zbMATH Keywords

algebraic surfacebivariate rational functionconvex gridgeometric incidences

Mathematics Subject Classification ID

General theory of nonlinear incidence geometry (51B05) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Erd?s problems and related topics of discrete geometry (52C10)

Review text

The paper under review concerns the following problem of Oppenheim (see [\textit{P. Erdős} and \textit{G. Purdy}, in: Handbook of combinatorics. Vol. 1--2. Amsterdam: Elsevier (North-Holland); Cambridge, MA: MIT Press. 809--874 (1995; Zbl 0852.52009)]): Given \(n\) points in the plane, how many triangles spanned by the points can have unit area? The main result of the paper states that the number of unit-area triangles spanned by \(n\) points in the plane is \(O(n^{20/9})\). This improves several results obtained earlier. Moreover, a particular version of the initial problem is considered, when the input points are supposed to lie on three arbitrary straight lines in the plane. It is proved that for any triple of distinct straight lines \(l_1\), \(l_2\), \(l_3 \in \mathbb R^2\) and for any integer \(n\) there exist subsets \(S_1\subset l_1\), \(S_2\subset l_2\), \(S_3\subset l_3\), each of cardinality \(\Theta(n)\), such that \(S_1\times S_2\times S_3\) spans \(\Theta(n^2)\) unit-area triangles.

Recommendations

• The number of unit-area triangles in the plane: theme and variations
• An improved bound on the number of unit area triangles
• An improved bound on the number of unit area triangles
• Distinct Triangle Areas in a Planar Point Set
• Extremal problems on triangle areas in two and three dimensions

Cites work

• A combinatorial problem on polynomials and rational functions
• A Szemerédi-Trotter type theorem in R^4
• An improved bound on the number of unit area triangles
• An incidence theorem in higher dimensions
• Extremal problems in discrete geometry
• Extremal problems on triangle areas in two and three dimensions
• How to find groups?
• scientific article; zbMATH DE number 863486 (Why is no real title available?)
• On a question of Erdős and Ulam
• On the number of unit-area triangles spanned by convex grids in the plane
• Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited
• Repeated angles in the plane and related problems
• Some extremal problems in geometry
• The number of unit-area triangles in the plane: theme and variations

Cited in

(10)

• Extremal problems on triangle areas in two and three dimensions
• Triangle areas in line arrangements
• Note on the unit area triangle problem
• The number of unit-area triangles in the plane: theme and variations
• An improved bound on the number of unit area triangles
• An improved bound on the number of unit area triangles
• On the dimension of exceptional parameters for nonlinear projections, and the discretized Elekes-Rónyai theorem
• Improved estimates on the number of unit perimeter triangles
• Zarankiewicz's problem for semi-algebraic hypergraphs
• Topological \(k\)-metrics

This page was built for publication: The number of unit-area triangles in the plane: theme and variation

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