The number of unit-area triangles in the plane: theme and variation
From MaRDI portal
Publication:722324
DOI10.1007/s00493-016-3440-8zbMath1399.52032OpenAlexW2963262304MaRDI QIDQ722324
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
Length, area, volume and convex sets (aspects of convex geometry) (52A38) Erd?s problems and related topics of discrete geometry (52C10) General theory of nonlinear incidence geometry (51B05)
Related Items (3)
On the dimension of exceptional parameters for nonlinear projections, and the discretized Elekes-Rónyai theorem ⋮ Triangle areas in line arrangements ⋮ Zarankiewicz's problem for semi-algebraic hypergraphs
Cites Work
- Unnamed Item
- An incidence theorem in higher dimensions
- Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited
- An improved bound on the number of unit area triangles
- A Szemerédi-Trotter type theorem in \(\mathbb R^4\)
- Extremal problems in discrete geometry
- On a question of Erdős and Ulam
- Extremal problems on triangle areas in two and three dimensions
- Repeated angles in the plane and related problems
- A combinatorial problem on polynomials and rational functions
- How to find groups?
- On the number of unit-area triangles spanned by convex grids in the plane
- Polynomials vanishing on grids: The Elekes-Rónyai problem revisited
- The number of unit-area triangles in the plane: Theme and variations
- Some extremal problems in geometry
This page was built for publication: The number of unit-area triangles in the plane: theme and variation
