On the number of unit-area triangles spanned by convex grids in the plane

preprint2015arXivOpen access

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 A,B⊂RA, B\subset\mathbb R, each of size n1/2n^{1/2}, the convex grid A×BA\times B spans at most O(n37/17log⁡2/17n)O(n^{37/17}\log^{2/17}n) unit-area triangles. This improves the best known upper bound O(n31/14)O(n^{31/14}) recently obtained in \cite{RS}. Our analysis also applies to more general families of sets AA, BB, known as sets of Szemerédi--Trotter type.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.