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

不可数集的有限子集的着色

Coloring finite subsets of uncountable sets

Peter Komjath, Saharon Shelah

摘要:

对于每一个(1 <= n< omega),(2^omega = omega_n)是一致的,并且存在一个函数(F:[omega_n]^{< omega}-> omega)使得每一个有限集最多可以写成两个不同单色集的并集(2^n-1)种方式。如果GCH成立,则对于每一个这样的着色,都有一个有限集,它至少可以写成(sum^ n_{i=1} {n+i choose n}{n choose i})两个具有相同颜色的集合的并集。

英文摘要:

It is consistent for every (1 <= n< omega) that (2^omega = omega_n) and there is a function (F:[omega_n]^{< omega}-> omega) such that every finite set can be written at most (2^n-1) ways as the union of two distinct monocolored sets. If GCH holds, for every such coloring there is a finite set that can be written at least (sum^n_{i=1}{n+i choose n}{n choose i}) ways as the union of two sets with the same color.

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

↑