Note on finitary Hindman numbers
From the introduction: ``Inspired by Paris-Harrington's strengthening of the finite Ramsey theorem, Spencer defined in a similar way the following numbers (which we denote by \((\mathrm{Sp}m,c)\)), strengthening the Folkman-Sanders theorem: Let \((\mathrm{Sp}m,c)\) be the last integer \(k\) such that whenever \([k]=\{1,\ldots, k\}\) is \(c\)-colored then there is \(H=\{a_0,\ldots, a_{l-1}\}\subset [k]\) such that \(\sum H\) (sums of elements of \(H\) with no repetition) is monochromatic and \(m\leq \min H\leq l\). Spencer asked if \((\mathrm{Sp}m,c)\) is primitive recursive. In this paper we give a positive answer to this question. In fact we define the more general numbers \((\mathrm{Sp}m,p,c)\) and show that it is in class \(\mathcal{E}_{5}\) of the Grzegorczyk hierarchy of primitive recursive functions.
- New bounds on the strength of some restrictions of Hindman’s Theorem
- New bounds on the strength of some restrictions of Hindman's theorem
- Bootstrapping the primitive recursive functions by only 27 colors
- ``Weak yet strong restrictions of Hindman's finite sums theorem
- Effectiveness of Hindman’s Theorem for Bounded Sums
This page was built for publication: Note on finitary Hindman numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288366)
