arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.0705math.CO
收藏

Erdos-Szekeres型陈述:Ramsey函数与一维可判定性

Erdos-Szekeres-type statements: Ramsey function and decidability in dimension 1

Boris Bukh, Jiri Matousek

摘要:

一个经典且广泛使用的Erdos和Szekeres引理断言,对于每个n,存在N使得每个实数的N项序列a包含一个n项递增子序列或一个n项非递减子序列;定量地说,具有此性质的最小N等于(n-1)^2+1。在本文的背景下,我们把这个引理表示为谓词集Phi={x_1<x_2,x_1 \ge x_2}$是Erdos-Szekeres,其中Ramsey函数ES_Phi(n)=(n-1)^2+1.一般来说,我们考虑任意有限集Phi={Phi_1,.,Phi_m},意味着每个Phi_j=Phi_j(x_1,.,x_k)是多项式方程和不等式的布尔组合,其中有k个实变量。我们将Phi定义为Erdos-Szekeres,如果对于每个n存在N,使得每个实数的N项序列a具有n项子序列b,使得Phi_j中的至少一个在b上处处成立,这意味着Phi_j(b_{i_1},.,b_{i_k})对于索引i_1,i_2,.,i_k,1<=i_1<i_2<. <i_k<= n.对于具有上述性质的最小N,我们将ES_Phi(n)写成。我们证明了两个主要结果。首先,在这种情况下,拉姆齐函数至多是双指数的(有时它们确实是双指数的):对于每个Erdens-Szekeres的Φ,存在一个常数C,使得ES_Phi(n)< exp(exp(Cn))。第二,有一个算法,给定φ,决定它是否是埃尔多斯-塞凯雷斯;因此,一维埃尔多斯-塞凯雷斯式定理原则上可以自动证明。

英文摘要:

A classical and widely used lemma of Erdos and Szekeres asserts that for every n there exists N such that every N-term sequence a of real numbers contains an n-term increasing subsequence or an n-term nondecreasing subsequence; quantitatively, the smallest N with this property equals (n-1)^2+1. In the setting of the present paper, we express this lemma by saying that the set of predicates Phi={x_1<x_2,x_1\ge x_2}$ is Erdos-Szekeres with Ramsey function ES_Phi(n)=(n-1)^2+1. In general, we consider an arbitrary finite set Phi={Phi_1,...,Phi_m} of semialgebraic predicates, meaning that each Phi_j=Phi_j(x_1,...,x_k) is a Boolean combination of polynomial equations and inequalities in some number k of real variables. We define Phi to be Erdos-Szekeres if for every n there exists N such that each N-term sequence a of real numbers has an n-term subsequence b such that at least one of the Phi_j holds everywhere on b, which means that Phi_j(b_{i_1},...,b_{i_k}) holds for every choice of indices i_1,i_2,...,i_k, 1<=i_1<i_2<... <i_k<= n. We write ES_Phi(n) for the smallest N with the above property. We prove two main results. First, the Ramsey functions in this setting are at most doubly exponential (and sometimes they are indeed doubly exponential): for every Phi that is Erdős--Szekeres, there is a constant C such that ES_Phi(n) < exp(exp(Cn)). Second, there is an algorithm that, given Phi, decides whether it is Erdos-Szekeres; thus, one-dimensional Erdos-Szekeres-style theorems can in principle be proved automatically.

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

↑