通过Schreier族的Ramsey和Nash-Williams组合数学
Ramsey and Nash-Williams combinatorics via Schreier families
摘要:
本文的主要结果是(a)推广了有限Ramsey分割定理,(b)利用这一推广得到了无限Nash-Williams分割定理的一个更强形式,以及Ellentuck的一个新证明,从而也得到了Galvin-Prikry的分割定理.在更一般和更强的层次上统一经典划分定理的适当工具是自然数集合的有限子集的Schreier族系统$({\cal A}_ξ)$,定义为每个可数序数$ξ$。
英文摘要:
The main results of this paper (a) extend the finite Ramsey partition theorem, and (b) employ this extension to obtain a stronger form of the infinite Nash-Williams partition theorem, and also a new proof of Ellentuck's, and hence Galvin-Prikry's partition theorem. The proper tool for this unification of the classical partition theorems at a more general and stronger level is the system of Schreier families $({\cal A}_ξ)$ of finite subsets of the set of natural numbers, defined for every countable ordinal $ξ$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。