Hindmanʼs coloring theorem in arbitrary semigroups

Hindmanʼs Theorem asserts that, for each finite coloring of the natural numbers, there are distinct natural numbers a1,a2,… such that all of the sums ai1+ai2+⋯+aim (m⩾1, i1

Saved in:
Bibliographic Details
Published in:Journal of algebra 2013-12, Vol.395, p.111-120
Main Authors: Golan, Gili, Tsaban, Boaz
Format: Article
Language:English
Subjects:
Almost-monochromatic set
Hindman Theorem
Hindman Theorem in groups
Hindman Theorem in semigroups
Monochromatic semigroup
Ramsey Theorem
Shevrin semigroup classification
Synchronizing semigroup
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Hindmanʼs Theorem asserts that, for each finite coloring of the natural numbers, there are distinct natural numbers a1,a2,… such that all of the sums ai1+ai2+⋯+aim (m⩾1, i1
ISSN:0021-8693
1090-266X
DOI:10.1016/j.jalgebra.2013.08.007