Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
HTML articles powered by AMS MathViewer
- by Andreas Weiermann and Wim Van Hoof PDF
- Proc. Amer. Math. Soc. 140 (2012), 2913-2927 Request permission
Abstract:
This article is concerned with investigations on a phase transition which is related to the (finite) Ramsey theorem and the Paris-Harrington theorem. For a given number-theoretic function $g$, let $R^d_c(g)(k)$ be the least natural number $R$ such that for all colourings $P$ of the $d$-element subsets of $\{0,\ldots ,R-1\}$ with at most $c$ colours there exists a subset $H$ of $\{0,\ldots ,R-1\}$ such that $P$ has constant value on all $d$-element subsets of $H$ and such that the cardinality of $H$ is not smaller than $\max \{k,g(\min (H))\}$. If $g$ is a constant function with value $e$, then $R^d_c(g)(k)$ is equal to the usual Ramsey number $R^d_c(\max \{e,k\})$; and if $g$ is the identity function, then $R^d_c(g)(k)$ is the corresponding Paris-Harrington number, which typically is much larger than $R^d_c(k)$. In this article we give for all $d\geq 2$ a sharp classification of the functions $g$ for which the function $m\mapsto R^d_m(g)(m)$ grows so quickly that it is no longer provably total in the subsystem of Peano arithmetic, where the induction scheme is restricted to formulas with at most $(d-1)$-quantifiers. Such a quick growth will in particular happen for any function $g$ growing at least as fast as $i\mapsto \varepsilon \cdot \underbrace {\log (\cdots (\log (}_{(d-1)-\mbox {times}}i)\cdots )$ (where $\varepsilon >0$ is fixed) but not for the function $g(i)=\frac {1}{\log ^*(i)}\cdot \underbrace {\log (\cdots (\log (}_{(d-1)-\mbox {times}}i)\cdots )$. (Here $\log ^*$ denotes the functional inverse of the tower function.) To obtain such results and even sharper bounds we employ certain suitable transfinite iterations of nonconstructive lower bound functions for Ramsey numbers. Thereby we improve certain results from the article A classification of rapidly growing Ramsey numbers (PAMS 132 (2004), 553–561) of the first author, which were obtained by employing constructive ordinal partitions.References
- H. L. Abbott, A note on Ramsey’s theorem, Canad. Math. Bull. 15 (1972), 9–10. MR 314673, DOI 10.4153/CMB-1972-002-5
- Lorenzo Carlucci, Gyesik Lee, and Andreas Weiermann, Sharp thresholds for hypergraph regressive Ramsey numbers, J. Combin. Theory Ser. A 118 (2011), no. 2, 558–585. MR 2739504, DOI 10.1016/j.jcta.2010.08.004
- Paul Erdős, András Hajnal, Attila Máté, and Richard Rado, Combinatorial set theory: partition relations for cardinals, Studies in Logic and the Foundations of Mathematics, vol. 106, North-Holland Publishing Co., Amsterdam, 1984. MR 795592
- Matt Fairtlough and Stanley S. Wainer, Hierarchies of provably recursive functions, Handbook of proof theory, Stud. Logic Found. Math., vol. 137, North-Holland, Amsterdam, 1998, pp. 149–207. MR 1640327, DOI 10.1016/S0049-237X(98)80018-9
- Jussi Ketonen and Robert Solovay, Rapidly growing Ramsey functions, Ann. of Math. (2) 113 (1981), no. 2, 267–314. MR 607894, DOI 10.2307/2006985
- Menachem Kojman, Gyesik Lee, Eran Omri, and Andreas Weiermann, Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers, J. Combin. Theory Ser. A 115 (2008), no. 6, 1036–1055. MR 2423347, DOI 10.1016/j.jcta.2007.12.006
- H. Lefmann, A note on Ramsey numbers, Studia Sci. Math. Hungar. 22 (1987), no. 1-4, 445–446. MR 932230
- Handbook of mathematical logic, Studies in Logic and the Foundations of Mathematics, vol. 90, North-Holland Publishing Co., Amsterdam, 1977. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis and A. S. Troelstra. MR 457132
- Andreas Weiermann, A classification of rapidly growing Ramsey functions, Proc. Amer. Math. Soc. 132 (2004), no. 2, 553–561. MR 2022381, DOI 10.1090/S0002-9939-03-07086-2
- Andreas Weiermann, Classifying the provably total functions of PA, Bull. Symbolic Logic 12 (2006), no. 2, 177–190. MR 2223920
Additional Information
- Andreas Weiermann
- Affiliation: Department of Mathematics, Ghent University, Krijgslaan 281 S22, B-9000 Ghent, Belgium
- MR Author ID: 317296
- Email: Andreas.Weiermann@UGent.be
- Wim Van Hoof
- Affiliation: Department of Mathematics, Ghent University, Krijgslaan 281 S22, B-9000 Ghent, Belgium
- Email: Wim.Vanhoof@UGent.be
- Received by editor(s): May 16, 2008
- Received by editor(s) in revised form: January 22, 2011, and March 4, 2011
- Published electronically: December 1, 2011
- Communicated by: Julia Knight
- © Copyright 2011
American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication. - Journal: Proc. Amer. Math. Soc. 140 (2012), 2913-2927
- MSC (2010): Primary 03F30; Secondary 03D20, 03C62, 05D10
- DOI: https://doi.org/10.1090/S0002-9939-2011-11121-3
- MathSciNet review: 2910777