Note on finitary Hindman numbers (Q2288366)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Note on finitary Hindman numbers
scientific article

    Statements

    Note on finitary Hindman numbers (English)
    0 references
    0 references
    0 references
    17 January 2020
    0 references
    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.''
    0 references
    Paris-Harrington's theorem
    0 references
    Folkman-Sanders theorem
    0 references
    Grzegorczyk hierarchy
    0 references
    Spencer numbers
    0 references
    tower function
    0 references
    0 references

    Identifiers