Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Regular Talk:
Classifying the phase transition threshold for unordered regressive Ramsey numbers

Edit abstract data

Speaker: Florian Pelupessy
Author(s): Florian Pelupessy and Andreas Weiermann
Slot: Wed, 11:30-11:50, Amphitheater A (col. 1)

Abstract

Following ideas of Richer (2000) we introduce the notion of unordered regressive
Ramsey numbers or unordered Kanamori-McAloon numbers. We show that these are of
Ackermannian growth rate. For a given number-theoretic function f we consider
unordered f-regressive Ramsey numbers and classify exactly the threshold for f
which gives rise to the Ackermannian growth rate of the induced unordered
f-regressive Ramsey numbers. This threshold coincides with the corresponding
threshold for the standard regressive Ramsey numbers.

Our proof is based on an extension of an argument from a corresponding
proof in a paper by Kojman,Lee,Omri and Weiermann 2007.

websites: Arnold Beckmann 2008-06-10 Valid HTML 4.01! Valid CSS!