Abstract
A finite set of real numbers is called convex if the differences between consecutive elements form a strictly increasing sequence. We show that, for any pair of convex sets , each of size , the convex grid spans at most unit-area triangles. This improves the best known upper bound recently obtained in \cite{RS}. Our analysis also applies to more general families of sets , , known as sets of Szemerédi--Trotter type.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.