Partitioning α-large sets for α<ε_ω

2010/01/14 by Michiel De Smet, De Smet, Michiel, Andreas Weiermann +1
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1001.2437

22 pages

arxiv created 2010/01/14 · arxiv updated 2010/02/26

Abstract

We generalise the results by Bigorajska and Kotlarski about partitioning α-large sets, by extending the domain up to ordinals below ε_ω. These results will be very useful to give a miniaturisation of the infinite Ramsey Theorem.

Related

• Ramsey Theory for Words over an Infinite Alphabet
• Partitions of groups into large subsets
• The barrier Ramsey theorem
• Schreier Sets in Ramsey Theory
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs