Hindman's coloring theorem in arbitrary semigroups

almost-monochromatic set Hindman theorem Hindman theorem in groups Hindman theorem in semigroups monochromatic semigroups Ramsey theorem Shevrin semigroup classification synchronizing semigroups

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Ramsey theory (05D10) Elementary theory of partitions (11P81) General structure theory for semigroups (20M10)

Abstract: Hindman's Theorem asserts that, for each finite coloring of the natural numbers, there are distinct natural numbers

a_{1}, a_{2}, d o t s

such that all of the sums

a_{i_{1}} + a_{i_{2}} + d o t s + a_{i_{m}}

(

m g e 1

,

i_{1} < i_{2} < d o t s < 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}, d o t s

of

S

such that all but finitely many of the products

a_{i_{1}} a_{i_{2}} c d o t s a_{i_{m}}

(

m g e 1

,

i_{1} < i_{2} < d o t s < 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.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Hindman's coloring theorem in arbitrary semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443249)