{"id":"68284f37-7ada-4a53-a3e2-5502cdf49822","arxiv_id":"2608.01962","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For r≥2 and k≥K r^2 log^6(2r), the paper proves R_r(k) ≤ exp(-c k/(r^2 log^4(2r))) r^{rk}, improving the previously known multicolor Ramsey upper bound.","lead":"This paper proves a new upper bound for multicolor Ramsey numbers, reducing the color dependence of the exponential saving from about r^9 to r^2 log^4. The result matters because it gives the best known bound for the diagonal Ramsey problem when the number of colors grows.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proof appears internally consistent; the main load-bearing risk is the quoted quantitative form of the imported Erdős–Szekeres regularization lemma (Lemma 2.1), on which the later book and reservoir estimates depend.","rationale":"The reader's weakest assumption correctly identifies Lemma 2.1 as the main unproved input, and my second pass confirms it is the only place where the central claim could lose support. I checked the internal arguments in Sections 3, 4, and 5 and found no mathematical error: the positivity lemma, the root filter bounds, the multivariate correlation theorem, the density increment, and the book construction all are consistent and the parameter bookkeeping closes. The proof is long and no machine verification is offered, but that is a reason for moderate confidence rather than for rejection. Since Lemma 2.1 is a published result and is used within the stated hypotheses, I do not see a ground to change the ACCEPT verdict. The proposed concrete test would settle the residual external-input risk by confirming the lemma's quantitative form and its applicability to the small-η regime used here.","tokens_in":20480,"tokens_out":46099,"duration_ms":368864,"concrete_test":"Independently extract the proof of [1, Lemma 5.2] and check: (a) the lemma's hypotheses place no lower bound on η and no lower bound on n in terms of η; (b) the two displayed bounds are literally ((1+η)/r)^s times n and (1/r − η)|W| − 1, with no hidden lower-order additive term; (c) the proof tolerates η = αϑ/r ≤ 1/(64r) when r is large and k is at the threshold (52). If any of these fail, recompute the page and reservoir inequalities in Theorem 5.3 with the corrected form and see whether the final r-dependence changes.","verdict_should_be":"UNCHANGED","load_bearing_attack":"I went through Sections 3–5 in detail. The root-filter identities (Lemmas 3.1–3.3) are correct; Theorem 3.4's averaging argument and the contradiction with β_r are valid; Theorem 4.2's density bookkeeping, page-retention lower bound, and reservoir recurrence all close with the stated parameter inequalities; Lemma 5.2's entropy estimate is sound; and the parameter choices in Lemma 5.4 satisfy the required hypotheses (57)–(63). The single least certain input is Lemma 2.1, imported from [1, Lemma 5.2]. It provides the preliminary spines S_i and the common reservoir W with the exact bounds |W| ≥ ((1+η)/r)^s n and |N_i(w)∩W| ≥ (1/r − η)|W| − 1. These numbers are used at the sharp end: the case split on s, the page-size verification via (42), and the reservoir verification via (73) all rely on the displayed constants. The proof applies the lemma with η = αϑ/r, which tends to 0 as r grows, and with s up to rt/4. If the lemma in [1] secretly requires η to be bounded below by an absolute constant, or requires n to be large compared to some function of η, then the use here would be out of regime. I found no evidence of such a restriction in the quoted statement, and the published lemma is presumably correct, so this is a verification gap in an external input rather than an internal flaw.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves a new upper bound for diagonal multicolor Ramsey numbers. Theorem 1.1 states that there are absolute constants c,K>0 such that for every r≥2 and every k≥K r^2 log^6(2r), one has R_r(k)≤ exp(-c k/(r^2 log^4(2r))) r^{rk}. The proof has two new ingredients: a higher-order correlation lemma based on a positive-coefficient root filter of variable order d (Theorem 3.4), and a retained-spine refinement of the multicolor book method (Theorem 4.2). An entropy estimate for off-diagonal Ramsey numbers (Lemma 5.2) is then used to close the argument. The paper also states a more flexible Theorem 1.2, from which Theorem 1.1 is derived by choosing d≈log(2r).","tokens_in":20777,"tokens_out":26407,"duration_ms":235546,"significance":"If correct, Theorem 1.1 is the strongest known upper bound for diagonal multicolor Ramsey numbers in the many-color regime, improving both the exponent saving and the admissible range of k over the recent results of Balister et al. and Narang and Tang. The proof is explicit and self-contained except for the quoted Erdős–Szekeres regularization lemma from [1]; the algebraic identities and parameter inequalities are checked carefully, and the absolute constants are chosen by existence arguments rather than fitted to the conclusion. The main residual risk is the exact quantitative content of the external Lemma 2.1, on which the later book and reservoir estimates depend.","major_comments":[],"minor_comments":[{"comment":"Several cross-references are incorrect: in the proof of Lemma 3.2, “Theorem 3.1” should be “Lemma 3.1”; in the proof of Lemma 3.3, “Theorem 3.2” should be “Lemma 3.2”; in the proof of Theorem 3.4, “Theorem 3.3(i)” and “Theorem 2.2” should be “Lemma 3.3(i)” and “Lemma 2.2”; and in Lemma 5.1, “Theorem 2.1” should be “Lemma 2.1.”","section":"§3.1–§3.2, §5.1"},{"comment":"The application of Lemma 2.1 uses η=αϑ/r, which tends to 0 as r grows, and s up to rt/4 in the small-s case, while the later estimates (73), the page-size check, and the reservoir check rely on the exact displayed constants in (6)–(7). I ask the authors to add a sentence confirming that the quoted form of [1, Lemma 5.2] holds for arbitrary η>0 with no implicit lower bound on η or hidden condition on n beyond the stated hypotheses. This is a verification request rather than a detected internal error.","section":"§5.2"},{"comment":"The abstract contains a stray “.b” at the end of “book method.b”; this should be removed.","section":"Abstract"}],"recommendation":"minor_revision","confidential_remarks":"I share the reader's broadly positive assessment. The proof appears internally consistent, and the claimed improvement over the existing multicolor bounds is significant. The minor issues listed should be addressed in the final version; in particular, the clarification concerning the scope of Lemma 2.1 will help future readers verify the sharp use of that lemma."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The headline is right: this paper genuinely improves the state of the art for diagonal multicolor Ramsey numbers in the many-color regime. Compared with the Narang–Tang preprint, the saving in the exponent goes from k/(r^9 log^6) to k/(r^2 log^4), and the k-threshold drops from r^14 log^12 to r^2 log^6. That is a large, concrete advance, not a cosmetic one. The two new ingredients—the variable-order root filter and the retained-spine refinement—are not in the cited literature, and the proof shows why they work.\n\nI read Sections 3–5 carefully. The correlation theorem is clean: the positivity argument via tensor products is simple and correct, and the tail estimate with the 1/d exponent is exactly what gives the improved r-dependence. The density-increment lemma and the book lemma are intricate but the bookkeeping closes. I checked the entropy estimate in Lemma 5.2 and the parameter verifications in Lemma 5.4; the inequalities (57)–(63) all hold with the stated choices. I did not find a circular step or a hidden fitting of constants. The proof is internally consistent.\n\nThe one soft spot is the imported Lemma 2.1 from Balister et al. The quantitative bounds |W| ≥ ((1+η)/r)^s n and the degree condition are used at the sharp end, with η = αϑ/r tending to 0 as r grows. If that published lemma secretly requires η bounded below by an absolute constant, or requires n to be large relative to some function of η, the application here would be out of regime. The stress-test note found no evidence of such a restriction, and the lemma is published, so this is a verification gap in an external input rather than an internal flaw. It deserves a careful check by the referee but does not undermine the argument as written.\n\nMinor issues: the abstract has a stray \"b\" after \"book method.\" The proof is long and parameter-heavy, so independent verification (human or formal) would be valuable, but that is a feature of this type of argument, not a defect.\n\nBottom line: this is a serious, important paper. The central argument holds up on inspection, and the one substantive caveat is about a quoted lemma, not about the authors' reasoning. It should definitely go to peer review. I would bring it to a reading group and would cite it.\n\nRecommendation: accept with minor revisions, after a referee checks Lemma 2.1's hypotheses and the bookkeeping in Lemma 5.4.","headline":"A substantial and apparently correct improvement of multicolor Ramsey upper bounds, with a clean proof and one external-lemma caveat worth checking.","tokens_in":21313,"tokens_out":2037,"would_cite":true,"duration_ms":19840,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C55","05D10","30D15"],"pacs":[],"model":"deepseek-v4-flash","headline":"Multicolor diagonal Ramsey numbers satisfy a sharper upper bound, with the exponential saving improved by a factor of order $r^7\\log^2(2r)$ and the sufficient $k$-range lowered by a factor of order $r^{12}\\log^6(2r)$.","keywords":["multicolor Ramsey numbers","diagonal Ramsey numbers","book method","root filters","higher-order correlation","relative entropy","regularization lemma","upper bounds"],"falsifier":"An $r$-coloring of $K_n$ with $n>\\exp(-c k/(r^2\\log^4(2r)))\\,r^{rk}$ and no monochromatic $K_k$, for some $k\\ge K r^2\\log^6(2r)$, would disprove Theorem 1.1 directly. The first place to look is whether Lemma 2.1's quantitative reservoir and degree bounds fail at $\\eta=\\alpha\\vartheta/r$, because such a failure would break the proof before the book argument begins.","tokens_in":20292,"feed_emoji":"🎨","tokens_out":9028,"duration_ms":75931,"temperature":0.7,"pith_summary":"This paper proves that the diagonal $r$-color Ramsey number $R_r(k)$ satisfies $R_r(k)\\le \\exp(-c k/(r^2\\log^4(2r)))\\,r^{rk}$ once $k\\ge K r^2\\log^6(2r)$, for absolute constants $c,K>0$. The interest is that both the exponential improvement and the range of $k$ now have much better dependence on the number of colors than previous multicolor bounds: the saving in the exponent is larger by a factor of order $r^7\\log^2(2r)$, and the sufficient lower bound on $k$ is smaller by a factor of order $r^{12}\\log^6(2r)$. The proof introduces a variable-order positive-coefficient root filter, an entire function whose negative-axis decay is $e^{-u\\cos(\\pi/d)}$ for an integer $d$ that may grow like $\\log(2r)$, and uses it to prove a higher-order correlation lemma with tail exponent $1/d$. It then refines the multicolor book method by retaining all preliminary color spines and using a one-coordinate entropy estimate to capture an extra saving $\\exp(-t^2/(64k))$ when the preliminary spines are small.","feed_headline":"Multicolor Ramsey bound sharpens exponent by r^7","feed_subtitle":"A variable-order root filter and retained-spine book method also lower the required k by about r^12 log^6(2r).","key_machinery":"The central object is the truncated exponential $E_d(z)=\\sum_{n\\ge0} z^n/(dn)!$, which averages over the $d$-th roots of unity: for $u\\ge0$, $E_d(u^d)=d^{-1}\\sum_{j=0}^{d-1}e^{u\\omega_d^j}$. Its negative-axis decay $|E_d(-u^d)|\\le e^{u\\cos(\\pi/d)}$, paired with the positive-axis growth $E_d(u^d)\\ge e^u/(2d)$, turns the ratio $G_{r,d}/H_{r,d}$ built from $H_{r,d}(z)=1+a_{r,d}E_d(z)^2$ and its odd part into a sharp threshold function. The multivariate sum $F_{r,d}(x_1,\\ldots,x_r)=\\sum_j G_{r,d}(x_j)\\prod_{i\\ne j}H_{r,d}(x_i)$ has nonnegative Taylor coefficients, so its expectation under independent copies is nonnegative; evaluating it at $L_{r,d}Z_i$ for $Z_i=\\langle\\sigma_i(U),\\sigma_i(U')\\rangle$ yields the higher-order correlation bound $\\mathbb{P}(Z_i\\ge\\lambda,\\, Z_j\\ge-1\\ \\forall j\\ne i)\\ge \\beta_r\\exp(-C_{r,d}(\\lambda+1)^{1/d})$. The second mechanism is the retained-spine refinement: all $r$ preliminary cliques $S_i$ and the common reservoir $W$ from the regularization lemma are kept; if $s=\\sum_i|S_i|\\ge rt/4$ the regularization gain alone wins, and if $s0$ such that for every $r\\ge2$ and every $k\\ge K r^2\\log^6(2r)$, one has $R_r(k)\\le \\exp(-c k/(r^2\\log^4(2r)))\\,r^{rk}$. Relative to the previously best multicolor bound, whose exponent saving was of order $k/(r^9\\log^6(2r))$ under the condition $k\\ge C r^{14}\\log^{12}(2r)$, this improves the saving by a factor of order $r^7\\log^2(2r)$ and lowers the displayed sufficient lower bound on $k$ by a factor of order $r^{12}\\log^6(2r)$. The proof achieves this by combining a variable-order root filter, which replaces the square-root tail of earlier correlation estimates by a $1/d$-power tail for an integer $d$ that may grow with $r$, with a retained-spine refinement of the book method, in which all $r$ preliminary monochromatic cliques from the regularization step are kept and the off-diagonal Ramsey problem inside the page set is handled by a one-coordinate multinomial entropy estimate.","pith_inferences":["Editorial inference: the root-filter construction is a template: any positive-coefficient entire function with negative-axis decay $e^{-u\\cos(\\pi/d)}$ and positive-axis growth $e^u$ should yield a correlation lemma with tail exponent $1/d$, and other filters, such as averages over the $d$-th roots of $-1$, might give different $r$-dependencies.","Editorial inference: the one-coordinate entropy estimate in Lemma 5.2 is stated for the diagonal problem, but the same inequality $R(b_1,\\ldots,b_r)\\le r^B e^{-t^2/(64k)}$ applies to off-diagonal target vectors, so the retained-spine argument may be reusable for mixed Ramsey numbers.","Editorial inference: the choice $d=\\Theta(\\log(2r))$ balances factors like $r^{2d/(d-1)}d^{4d/(d-1)}$ against the threshold; a finer optimization over $d$ or a combination of two filters might improve the $r$-dependence further, since the paper does not claim optimality of the absolute constants.","Editorial inference: because the correlation theorem holds for arbitrary Hilbert-space-valued maps $\\sigma_i$, it may have applications outside Ramsey theory, for instance wherever one studies simultaneous weak correlation of several vector-valued maps and needs a quantitative clustering conclusion."],"forward_implications":["For every growing number of colors, the diagonal Ramsey upper bound has saving $\\exp(-c k/(r^2\\log^4(2r)))$ instead of the previous $\\exp(-c k/(r^9\\log^6(2r)))$, so the exponent saving is larger by a factor of order $r^7\\log^2(2r)$.","The theorem holds already for $k\\ge K r^2\\log^6(2r)$, which lowers the previously sufficient $k$-range by a factor of order $r^{12}\\log^6(2r)$.","With $d=3$ the same proof gives a saving of order $k/(r^3\\log^2(2r))$, and with $d=4$ a saving of order $k/(r^{8/3}\\log^{4/3}(2r))$, so smaller orders of the root filter yield weaker but still valid bounds.","The parametrized Theorem 1.2 gives a family of bounds indexed by the root-filter order $d$, so the method contains an explicit trade-off between the size of the exponential saving and the required size of $k$.","For fixed small $r$, the paper does not attempt to optimize the numerical base; in particular, the specialized two-color bound remains stronger when $r=2$."],"supporting_citations":[{"why":"Supplies Lemma 2.1, the quantitative regularization lemma producing the preliminary spines $S_i$ and common reservoir $W$, and provides the earlier multicolor book framework that this paper refines.","marker":"[1]"},{"why":"Gives the first exponential improvement for diagonal Ramsey via the book method, whose density-increment and book-construction template the retained-spine argument adapts.","marker":"[2]"},{"why":"Provides the classical recursion and the multinomial bound $R(k_1,\\ldots,k_r)\\le r^B$, used throughout the entropy estimate and the final Ramsey-number comparison.","marker":"[6]"},{"why":"Gives the previous best multicolor upper bound with saving $k/(r^9\\log^6(2r))$ under $k\\ge C r^{14}\\log^{12}(2r)$, which is the baseline the main theorem improves.","marker":"[8]"}],"fun_headline_variants":["Multicolor Ramsey bound: exponent saving up by r^7","New Ramsey upper bound: saving factor r^7, k down r^12","Variable-order root filter sharpens Ramsey bound by r^7","Retained-spine book method improves Ramsey exponent by r^7"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing input is Lemma 2.1, an imported regularity statement that guarantees the $r$ preliminary color-cliques $S_i$ and a common reservoir $W$ of size at least $((1+\\eta)/r)^s n$ with color-$i$ degrees at least $(1/r-\\eta)|W|-1$ for every $w\\in W$; if those quantitative guarantees failed at the small slack $\\eta=\\alpha\\vartheta/r$ used in Section 5, the page-retention and reservoir estimates of the book argument would collapse.","fun_headline_variants_meta":{"raw":{"variants":["Multicolor Ramsey bound: exponent saving up by r^7","New Ramsey upper bound: saving factor r^7, k down r^12","Variable-order root filter sharpens Ramsey bound by r^7","Retained-spine book method improves Ramsey exponent by r^7"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000659,"raw_usage":{"total_tokens":2991,"prompt_tokens":902,"completion_tokens":2089,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":518,"completion_tokens_details":{"reasoning_tokens":2013}},"tokens_in":518,"tokens_out":2089,"duration_ms":12199,"temperature":1.0,"reasoning_tokens":2013,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T15:05:47.829281+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"An $r$-coloring of $K_n$ with $n>\\exp(-c k/(r^2\\log^4(2r)))\\,r^{rk}$ and no monochromatic $K_k$, for some $k\\ge K r^2\\log^6(2r)$, would disprove Theorem 1.1 directly. The first place to look is whether Lemma 2.1's quantitative reservoir and degree bounds fail at $\\eta=\\alpha\\vartheta/r$, because such a failure would break the proof before the book argument begins.","supporting_citations":[{"cited_title":"Balister, B","cited_arxiv_id":null,"evidence_quote":"Supplies Lemma 2.1, the quantitative regularization lemma producing the preliminary spines $S_i$ and common reservoir $W$, and provides the earlier multicolor book framework that this paper refines."},{"cited_title":"Campos, S","cited_arxiv_id":null,"evidence_quote":"Gives the first exponential improvement for diagonal Ramsey via the book method, whose density-increment and book-construction template the retained-spine argument adapts."},{"cited_title":"Erdős, G","cited_arxiv_id":null,"evidence_quote":"Provides the classical recursion and the multinomial bound $R(k_1,\\ldots,k_r)\\le r^B$, used throughout the entropy estimate and the final Ramsey-number comparison."},{"cited_title":"Schrijver Number Quasi-Tensorization and Multicolor Ramsey Bounds via Robust OR Polynomials","cited_arxiv_id":"2607.25023","evidence_quote":"Gives the previous best multicolor upper bound with saving $k/(r^9\\log^6(2r))$ under $k\\ge C r^{14}\\log^{12}(2r)$, which is the baseline the main theorem improves."}],"review_version":2}