Block Combinatorics

Details Block Combinatorics Block Combinatorics

2004-06-09

arxiv.org/abs/math/0406188v1

Mathematics

Combinatorics

26 pages, AMS-LaTeX

Scientific paper

In this paper we extend the block combinatorics partition theorems of Hindman and Milliken in the setting of the recursive system of the block Schreier families (B^xi) consisting of families defined for every countable ordinal xi. Results contain (a) a block partition Ramsey theorem for every countable ordinal xi (Hindman's theorem corresponding to xi=1, and Milliken's theorem to xi a finite ordinal), (b) a countable ordinal form of the block Nash-Williams partition theorem, and (c) a countable ordinal block partition theorem for sets closed in the infinite block analogue of Ellentuck's topology.

Affiliated with

Also associated with

No associations

Rating

Block Combinatorics 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 Block Combinatorics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Block Combinatorics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376241