The Threshold for Ackermannian Ramsey numbers

Details The Threshold for Ackermannian Ramsey numbers The Threshold for Ackermannian Ramsey numbers

2005-05-05

arxiv.org/abs/math/0505086v1

Mathematics

Combinatorics

Scientific paper

For a function $g:\N\to \N$, the \emph{$g$-regressive Ramsey number} of $k$ is the least $N$ so that \[N\stackrel \min \longrightarrow (k)_g\] . This symbol means: for every $c:[N]^2\to \N$ that satisfies $c(m,n)\le g(\min\{m,n\})$ there is a \emph{min-homogeneous} $H\su N$ of size $k$, that is, the color $c(m,n)$ of a pair $\{m,n\}\su H$ depends only on $\min\{m,n\}$. It is known (\cite{km,ks}) that $\id$-regressive Ramsey numbers grow in $k$ as fast as $\Ack(k)$, Ackermann's function in $k$. On the other hand, for constant $g$, the $g$-regressive Ramsey numbers grow exponentially in $k$, and are therefore primitive recursive in $k$. We compute below the threshold in which $g$-regressive Ramsey numbers cease to be primitive recursive and become Ackermannian, by proving: Suppose $g:\N\to \N$ is weakly increasing. Then the $g$-regressive Ramsey numbers are primitive recursive if an only if for every $t>0$ there is some $M_t$ so that for all $n\ge M_t$ it holds that $g(m)

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-114175