arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.3600math.COmath.GR
收藏

任意半群上的Hindman染色定理

Hindman's Coloring Theorem in arbitrary semigroups

Gili Golan, Boaz Tsaban

摘要:

Hindman定理断言,对于自然数的每个有限着色,存在不同的自然数$a_1,a_2,\dots$,使得所有的和$a_{i_1}+a_{i_2}+\dots+a_{i_m}$($m\ge 1$,$i_1<i_2<\dots<i_m$)具有相同的颜色。著名的Galvin-Glazer证明Hindman定理和Shevrin对半群的分类一起暗示,对于每个无限半群$S$的每个有限着色,都有$S$的不同元素$a_1,a_2,\dots$,使得几乎所有的乘积$a_{i_1}a_{i_2}\cdots a_{i_m}$($m\ge 1$,$i_1<i_2<\dots<i_m$)都有相同的颜色。利用这些方法,我们刻画了半群$S$,使得对于$S$的每个有限着色,存在$S$的无限个\emph{subsemigroup} $T$,使得$T$的几乎所有成员具有相同的颜色.我们的表征连接我们的研究,一个经典的问题,美利肯,伯恩赛德集团和塔斯基怪物。我们还提出了一个应用拉姆齐的图着色定理Shevrin的理论。

英文摘要:

Hindman's Theorem asserts that, for each finite coloring of the natural numbers, there are distinct natural numbers $a_1,a_2,\dots$ such that all of the sums $a_{i_1}+a_{i_2}+\dots+a_{i_m}$ ($m\ge 1$, $i_1<i_2<\dots<i_m$) have the same color. The celebrated Galvin--Glazer proof of Hindman's Theorem and a classification of semigroups due to Shevrin, imply together that, for each finite coloring of each infinite semigroup $S$, there are distinct elements $a_1,a_2,\dots$ of $S$ such that all but finitely many of the products $a_{i_1}a_{i_2}\cdots a_{i_m}$ ($m\ge 1$, $i_1<i_2<\dots<i_m$) have the same color. Using these methods, we characterize the semigroups $S$ such that, for each finite coloring of $S$, there is an infinite \emph{subsemigroup} $T$ of $S$, such that all but finitely many members of $T$ have the same color. Our characterization connects our study to a classical problem of Milliken, Burnside groups and Tarski Monsters. We also present an application of Ramsey's graph-coloring theorem to Shevrin's theory.

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

↑