A partition theorem for a large dense linear order

Details A partition theorem for a large dense linear order A partition theorem for a large dense linear order

2005-06-07

arxiv.org/abs/math/0506123v1

Mathematics

Logic

LaTeX, 77 pages, 3 figures

Scientific paper

Let Q_K=(Q,<_Q)$ be a strongly K-dense linear order of size K for a suitable cardinal K. We prove, for all integers m > 1 that there is a finite value t_m^+ such that the set of all m-tuples from Q can be divided into t_m^+ many classes, such that whenever any of these classes C is colored with fewer than K many colors, there is a copy Q* of Q_K such that all m-tuples from Q* in C receive the same color. As a consequence we obtain that whenever we color the m-tuples of Q with fewer than K many colors, there is a copy of Q_K all m-tuples from which are colored in at most t_m^+ colors. In other words, the partition relation Q_K -->(Q_K)^m_{2 we have t_m^+ > t_m, the m-th tangent number. The paper also contains similar partition results about K-Rado graphs. A consequence of our work and some earlier results of Hajnal and Komjath is that a theorem of Shelah known to follow from a large cardinal assumption in a generic extension, does not follow from any large cardinal assumption on its own.

Affiliated with

Also associated with

No associations

Rating

A partition theorem for a large dense linear order 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 A partition theorem for a large dense linear order, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A partition theorem for a large dense linear order will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-538641