arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.06989math.CO
收藏

关于平面内凸网格所跨单位面积三角形的个数

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

Orit E. Raz, Micha Sharir, Ilya D. Shkredov

摘要:

一个有限的实数集称为凸的,如果相邻元素之间的差形成严格递增序列。我们证明了,对于任何一对凸集$A, B\subset\mathbb R$,每个大小为$n^{1/2}$,凸网格$A\times B$最多跨越$O(n^{37/17}\log^{2/17}n)$单位面积三角形。这改进了最近在\cite{RS}中获得的最著名的上界$O(n^{31/14})$。我们的分析也适用于更一般的家庭的集合$A$,$B$,被称为集Szemerédi-Trotter型。

英文摘要:

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

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑