Ramsey Theory for Words Representing Rationals

Details Ramsey Theory for Words Representing Rationals Ramsey Theory for Words Representing Rationals

2010-11-02

arxiv.org/abs/1011.0580v1

Mathematics

Combinatorics

Scientific paper

Ramsey theory for words over a finite alphabet was unified in the work of Carlson and Furstenberg-Katznelson. Carlson, in the same work, outlined a method to extend the theory for words over an infinite alphabet, but subject to a fixed dominating principle, proving in particular an Ellentuck version, and a corresponding Ramsey theorem for k=1. In the present work we develop in a systematic way a Ramsey theory for words (in fact for {\omega}-Z*-located words) over a doubly infinite alphabet extending Carlson's approach (to countable ordinals and Schreier-type families), and we apply this theory, exploiting the Budak-Isik-Pym representation, to obtain a partition theory for the set of rational numbers. Furthermore, we show that the theory can be used to obtain partition theorems for arbitrary semigroups, stronger than known ones.

Affiliated with

Also associated with

No associations

Rating

Ramsey Theory for Words Representing Rationals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ramsey Theory for Words Representing Rationals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ramsey Theory for Words Representing Rationals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-595496