高阶Erdos-Szekeres定理
Higher-order Erdos--Szekeres theorems
摘要:
设P=(p_1,p_2,.,p_N)是平面中的点的序列,其中p_i=(x_i,y_i)并且x_1<x_2<. <x_N。一个著名的1935年Erdos-Szekeres定理断言,每个这样的P包含一个$\sqrt N$点的单调子序列S。另一个,同样著名的定理从同一文件意味着,每一个这样的P包含一个凸或凹的子序列的$Ω(\log N)$点。单调性是由点对确定的性质,而凸性涉及点的三元组。我们提出了一个推广,使这两个定理的成员的一个无限的家庭拉姆齐型的结果。首先,我们定义一个(k+1)-元组$K\subseteq P$是积极的,如果它位于一个函数的图,其k阶导数是处处非负的,类似的负(k+1)-元组。然后我们说$S\subseteq P$是k阶单调的,如果它的(k+1)-元组都是正的或都是负的。我们研究了相应的Ramsey型结果的定量界(即,在每个N点P中可以保证多大k阶单调子序列)。我们得到了一个$Ω(\log^{(k-1)}N)$下界((k-1)次重对数).这是基于一个定量的拉姆齐型定理,我们称之为传递着色的完全(k+1)-一致超图,它也提供了一个统一的看法,两个经典的Erdos-Szekeres上述结果。对于k=3,我们构造了一个几何例子,提供了一个$O(\log\log N)$上界,紧到一个乘法常数。因此,我们得到了R^3中序型齐次子集的拉姆齐型定理的类似上界,以及杜伊莫维奇和朗格曼最近使用的R^4中超平面的拉姆齐型定理。
英文摘要:
Let P=(p_1,p_2,...,p_N) be a sequence of points in the plane, where p_i=(x_i,y_i) and x_1<x_2<...<x_N. A famous 1935 Erdos--Szekeres theorem asserts that every such P contains a monotone subsequence S of $\sqrt N$ points. Another, equally famous theorem from the same paper implies that every such P contains a convex or concave subsequence of $Ω(\log N)$ points. Monotonicity is a property determined by pairs of points, and convexity concerns triples of points. We propose a generalization making both of these theorems members of an infinite family of Ramsey-type results. First we define a (k+1)-tuple $K\subseteq P$ to be positive if it lies on the graph of a function whose kth derivative is everywhere nonnegative, and similarly for a negative (k+1)-tuple. Then we say that $S\subseteq P$ is kth-order monotone if its (k+1)-tuples are all positive or all negative. We investigate quantitative bound for the corresponding Ramsey-type result (i.e., how large kth-order monotone subsequence can be guaranteed in every N-point P). We obtain an $Ω(\log^{(k-1)}N)$ lower bound ((k-1)-times iterated logarithm). This is based on a quantitative Ramsey-type theorem for what we call transitive colorings of the complete (k+1)-uniform hypergraph; it also provides a unified view of the two classical Erdos--Szekeres results mentioned above. For k=3, we construct a geometric example providing an $O(\log\log N)$ upper bound, tight up to a multiplicative constant. As a consequence, we obtain similar upper bounds for a Ramsey-type theorem for order-type homogeneous subsets in R^3, as well as for a Ramsey-type theorem for hyperplanes in R^4 recently used by Dujmovic and Langerman.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。