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

一个分拆定理

A Partition Theorem

Saharon Shelah

摘要:

我们证明如下:在三个变量中存在原始递归函数f ^*(-,-),使得:对于每个自然数t,n>0,和c,对于任何自然数k>=f^* t(n,c),以下成立。假设L是具有n>0个字母的字母表,M是{1,…,k}具有=<t个成员,V是从M到L的函数的集合,最后d是V的c-着色(即具有域V和至多c个成员的范围的函数)。然后存在d-单色V-线,这意味着存在包含在{1,.,k},具有至少t个成员和从{u in M:u不是w的子集}到L的函数r,使得令Y={eta in V:eta扩展r,并且对于每个s=1,.,t它在{u in M:u是w的s-元子集}上是常数,我们有:d对Y的限制是常数(对于t=1,这些是Hales Jewett数)。

英文摘要:

We prove the following: there is a primitive recursive function f_-^*(-,-), in the three variables, such that: for every natural numbers t,n>0, and c, for any natural number k>=f^*_t(n,c) the following holds. Assume L is an alphabet with n>0 letters, M is the family of non empty subsets of {1,...,k} with =<t members and V is the set of functions from M to L, and lastly d is a c-colouring of V (i.e. a function with domain V and range with at most c members). Then there is a d-monochromatic V-line, which means that there are w included in {1,...,k}, with at least t members and a function r from {u in M: u not a subset of w} to L such that letting Y={eta in V: eta extends r and for each s=1,...,t it is constant on {u in M: u is an s-element subset of w}}, we have: the restriction of d to Y is constant (for t=1 those are the Hales Jewett numbers).

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

↑