{"id":"50c8b0c6-ffca-42cc-b727-c25d122c5b6d","arxiv_id":"2411.16038","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":5,"one_line_summary":"A sufficient condition for optimality in the Tammes problem is formulated from the Delsarte bound and demonstrated on the icosahedron and the 600-cell.","lead":"This paper states a certificate-style condition, based on the Delsarte linear programming bound, under which a given set of points on a sphere is guaranteed to solve the Tammes problem of maximizing the minimum pairwise distance. It then checks the condition on three examples: the cross-polytope, the icosahedron, and the 600-cell in four dimensions.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Example 7's 600-cell certificate depends on unverified high-degree polynomial identities in Q(√5), so the claimed exact value d_{4,120} is not yet auditable and needs an exact-arithmetic recomputation.","rationale":"The reader's weakest_assumption correctly identifies Example 7 as the central unverified step. I checked the logic of Theorem 3 and found no internal flaw: the two cases in the proof are exhaustive, Lemma 2 is used correctly, and the role of condition (iii) is to exclude configurations with inner-product threshold at or below t2. The cross-polytope and icosahedron examples are either trivial or classical and their certificates are simple enough to verify by hand; the 600-cell example is the only genuinely new nontrivial Tammes value claimed. Approximate numerical checks of the displayed coefficients suggest they are plausible: all listed Gegenbauer coefficients are positive, f# is near 120, and g# is near 62.7, so I see no evidence of an actual falsehood. The concern is epistemic rather than logical: the paper asserts the algebraic identities without providing a derivation, code, or certificate, and a typo in Example 6's g# shows that such assertions are not risk-free. Therefore the reader's CONDITIONAL verdict is appropriate, and my pass does not change it. The prescribed concrete test, an exact recomputation in Q(√5), would settle the matter completely.","tokens_in":9109,"tokens_out":11661,"duration_ms":106621,"concrete_test":"Run an exact computer-algebra check of Example 7 in Q(√5): expand the displayed product for f into the degree-17 Gegenbauer basis for n = 4 using the recurrence in Section 2, compare the coefficient vector with the one printed, verify that every coefficient is nonnegative, evaluate f(1) and c0 and check f(1)/c0 = 120 exactly, and similarly expand g and verify that 120 > g# exactly. If the identities pass, the certificate for d_{4,120} is established; if any coefficient differs, the claimed value is unsupported.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 3 itself is a sound repackaging of the Delsarte LP certificate: equality in Lemma 2 forces f to vanish on all pairwise inner products of a competing configuration, and condition (iii) rules out the remaining case, so the proof logic is internally consistent. The load-bearing point is Example 7: the claimed value d_{4,120} = (√5−1)/2 rests entirely on two displayed polynomial identities with coefficients in Q(√5), asserted without derivation, code, or a formal proof certificate. Specifically, the paper must establish (a) the product form of f equals the given degree-17 Gegenbauer expansion, (b) every coefficient is nonnegative, (c) f(1)/c0 = 120 exactly, and (d) g# < 120 exactly. A single wrong coefficient, missing term, or equality failure would invalidate the example without affecting the theorem's abstract statement. The remark that Maple can perform the computation is not a reproducibility artifact; no worksheet, script, or machine-checkable certificate is shipped. The sign condition f(t) ≤ 0 on [−1, t_C] follows from the factor structure, and a quick discriminant check shows the quadratic factor has no real roots in (1/2, t_C), but none of this is documented, and the incorrect printed value of g# in Example 6 further underscores that the algebraic details need independent verification.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper restates the Delsarte linear programming bound for spherical codes as a sufficient condition (Theorem 3) for a configuration C to solve the Tammes problem. The theorem is then applied to three families: the n-dimensional cross-polytope (Example 5), the icosahedron (Example 6), and the 600-cell (Example 7). The proof of Theorem 3 is a standard and correct application of the Delsarte–Goethals–Seidel method: equality in Lemma 2 forces f to vanish on all pairwise inner products of a competing configuration, and conditions (ii)–(iii) rule out any competitor with larger minimum distance. Examples 5 and 6 are elementary and essentially correct, though Example 6 contains a miscalculated value of g#. Example 7 is the main claimed new application; it rests on high-degree polynomial identities in Q(√5) that are asserted without derivation, code, or a machine-checkable certificate.","tokens_in":9425,"tokens_out":7669,"duration_ms":70077,"significance":"Theorem 3 is a correct but not conceptually novel restatement of the Delsarte LP bound; its contribution is the construction of auxiliary polynomials for particular N. If Example 7 were fully verified, the paper would provide a self-contained certificate for the known optimality of the 600-cell among 120-point configurations in S^3. However, the absence of exact-arithmetic verification for the 600-cell certificate means the headline value d_{4,120} = (√5−1)/2 is not established by the text as written. The paper ships no scripts, worksheets, or proof certificates, which is a meaningful deficiency for a paper whose central claims are computational identities.","major_comments":[{"comment":"The claims that the product form of f equals the displayed degree-17 Gegenbauer expansion, that all Gegenbauer coefficients are nonnegative, that f(1)/c0 = 120 exactly, that g ∈ P(13, 1/2, 4), and that g# < 120 exactly are supported only by 'direct computation' and Remark 8's reference to Maple. No worksheet, script, log, or formal certificate is provided. Because one sign error or one omitted term invalidates the example, these identities are load-bearing. Please supply a complete exact-arithmetic verification over Q(√5) (e.g., a Maple workbook or a Mathematica notebook with exact coefficients and interval checks) and state clearly which of the asserted identities are machine-checked.","section":"Section 4, Example 7"},{"comment":"The printed Gegenbauer expansion of f omits the coefficients of P13 and P12; as printed, the display jumps from P14 to P11. If these coefficients are zero, this should be stated; if the display is incomplete, the identity is not verifiable. Similar care is needed for the list of coefficients of g, which appears complete.","section":"Section 4, Example 7"},{"comment":"The printed value g# = 12/(5√5) is incorrect; direct calculation from the displayed expansion gives g# = 3(√5−1) ≈ 3.708. The inequality 12 > g# remains true with the corrected value, so Example 6 is not invalidated, but the numerical error illustrates that the algebraic details in the paper need independent verification.","section":"Section 4, Example 6"}],"minor_comments":[{"comment":"It would help to state explicitly that c0 = 1/n for f(t) = t(t+1), since the computation f# = 2n jumps from the definition.","section":"Section 4, Example 5"},{"comment":"There are several spacing and OCR-style typos, e.g., 'po ints' in the abstract and 'setz' in Example 7; a careful proofread is needed.","section":"General"},{"comment":"In the Gegenbauer recurrence, the notation P^{(n)}_k(t) is used inconsistently; align the notation across Definition 1, Lemma 2, and the examples.","section":"Section 2"},{"comment":"Reference [5] (Boyvalenkov and Danev) is listed but never cited in the body; since it is directly relevant to the 600-cell example, cite it where appropriate or remove it.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The main risk is that the 600-cell example is not reproducible. If the authors cannot supply a verified certificate, the paper's contribution reduces to two elementary examples and a standard theorem. I would not recommend rejecting outright because the gap is fixable in revision, but the revision must include the missing computations."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Read it. Theorem 3 is a correct but not deep reorganization of the Delsarte–Goethals–Seidel LP bound: if f certifies N ≤ f# and equality holds for your configuration, and a second function g rules out better configurations with t ≤ t2, then you have optimality. The proof is clean and the case split works. That part is solid.\n\nWhat is genuinely useful is Example 7, a 600-cell certificate for d_{4,120}. If the displayed degree-17 and degree-13 Gegenbauer expansions are correct, this is a nice explicit proof of optimality for a known result. The problem is that those expansions are asserted. The text gives no derivation, no worksheet, no code, and Remark 8's 'Maple can do it' is not a reproducibility artifact. A single wrong coefficient among the many listed would invalidate the example. Given that Example 6 already contains a wrong printed g# (the text says 12/(5√5), correct value is 3(√5−1) ≈ 3.708), I do not trust the algebraic identities in Example 7 without an independent exact-arithmetic check.\n\nExample 5 is trivial, Example 6 is classical. The theorem is a modest contribution: it packages the LP certificate in a way that lets you handle the 'gap' case with a second function, but the machinery is standard and the authors do not cite prior work on the 600-cell optimality (e.g., Pfender or the spherical-code literature) to clarify what is new.\n\nThe paper is written for people working on spherical codes and packing who want explicit certificates. With the 600-cell computation verified and the typo fixed, it would be a reasonable journal paper. As it stands, it needs that verification before acceptance. I would send it to a referee, instructing them to check Example 7 exactly.","headline":"Sound but mostly a repackaging of the Delsarte bound; the 600-cell certificate is the real content and it is not yet auditable.","tokens_in":9975,"tokens_out":2632,"would_cite":false,"duration_ms":23377,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["52C17","90C05"],"pacs":[],"model":"deepseek-v4-flash","headline":"Polynomial certificates fix exact Tammes distances","keywords":["Tammes problem","spherical codes","linear programming bound","Gegenbauer polynomials","optimal spherical configurations","cross polytope","icosahedron","600-cell"],"falsifier":"Expand the displayed $f$ and $g$ in the Gegenbauer basis and check every coefficient for nonnegativity in exact arithmetic, or evaluate $f(t)$ on $[-1,(\\sqrt{5}+1)/4]$ at high precision and test the identity $f(1)=120\\,c_0$; a single failed coefficient sign, a single positive value on the interval, or a mismatch in $f^{\\#}$ would refute the 600-cell example.","tokens_in":8881,"feed_emoji":"⚪","tokens_out":8469,"duration_ms":73475,"temperature":0.7,"pith_summary":"This paper gives a sufficient condition, in the linear programming framework for spherical codes, for a point configuration on the unit sphere to solve the Tammes problem, which asks how to place $N$ points so the smallest pairwise distance is as large as possible. The condition asks for two polynomials $f$ and $g$ with nonnegative Gegenbauer coefficients: $f$ must be nonpositive on the interval of allowed inner products and must attain $N = f^{\\#}=f(1)/c_0$, while $g$ must stay below $N$ on a smaller interval. If such certificates exist, Theorem 3 concludes $d_{n,N}=d_C$. The authors verify these certificates for the cross-polytope in any dimension, the icosahedron with $N=12$ on $\\mathbb{S}^2$, and the 600-cell with $N=120$ on $\\mathbb{S}^3$, recovering exact Tammes values in each case.","feed_headline":"Polynomial certificates fix exact Tammes distances","feed_subtitle":"Two explicit polynomials certify each optimum, opening a path to exact answers for larger N.","key_machinery":"The central object is the class $\\mathcal{P}(k,\\tau,n)$: polynomials of degree at most $k$ whose expansion in Gegenbauer polynomials $P_i^{(n)}$ has nonnegative coefficients ($c_0>0$ and $c_i\\ge 0$) and which are nonpositive on $[-1,\\tau]$. The derived quantity $f^{\\#}=f(1)/c_0$ serves as the linear-programming upper bound on the size of a spherical code. Lemma 2 uses the positive definiteness of Gegenbauer kernels to prove $N\\le f^{\\#}$ for any configuration, with equality forcing $f$ to vanish on every pairwise inner product. Theorem 3 then layers on the second polynomial $g$ and the zero-free interval $(t_2,t_C)$, converting the pair $(f,g)$ into a certificate that the configuration solves the Tammes problem.","core_discovery":"The central claim is Theorem 3: a configuration $C\\subset\\mathbb{S}^{n-1}$ is optimal for the Tammes problem if one can exhibit $f\\in\\mathcal{P}(k_1,t_C,n)$ with $N=f^{\\#}$, a threshold $t_2<t_C$ on which $f$ has no zeros in $(t_2,t_C)$, and a second function $g\\in\\mathcal{P}(K_2,t_2,n)$ with $g^{\\#}<N$. The proof runs a two-case argument against any competing configuration $S$: if $S$'s maximal inner product is at most $t_2$, the Delsarte-type bound forces $N\\le g^{\\#}$, contradicting condition (iii); if it is above $t_2$, then $f$ is nonzero at the maximizing pair, yet the equality case of the bound forces $f$ to vanish on all pairs. No competitor can beat $d_C$. The paper supplies explicit $f$ and $g$ for the cross-polytope, for the icosahedron, and for the 600-cell, concluding $d_{n,2n}=\\sqrt{2}$, $d_{3,12}=4/\\sqrt{10+2\\sqrt{5}}$, and $d_{4,120}=(\\sqrt{5}-1)/2$.","pith_inferences":["A natural next step, not taken by the paper, is to search computationally for certificates: if a numerical optimizer can find $f$ and $g$ of moderate degree satisfying Theorem 3, that would settle the Tammes value for $N$ where only heuristic packings are known.","The 600-cell example suggests that highly symmetric regular polytopes may come with low-degree certificates; testing whether the 24-cell or other regular polytopes admit similar pairs would extend the pattern.","Because Theorem 3 gives only a sufficient condition, a failed search for certificates proves nothing; computational experiments that cannot produce such a pair should not be read as evidence against optimality.","The equality condition in Lemma 2 yields a cheap numerical check: evaluate the candidate $f$ on the configuration's pairwise inner products; any nonzero value would immediately disprove the claimed certificate."],"forward_implications":["The cross-polytope realizes $d_{n,2n}=\\sqrt{2}$ for every $n\\ge 2$, certified by $f(t)=t(t+1)$ and $g(t)=t+1$.","The icosahedron realizes $d_{3,12}=4/\\sqrt{10+2\\sqrt{5}}$, certified by a degree-4 polynomial $f$ and a degree-2 polynomial $g$.","The 600-cell realizes $d_{4,120}=(\\sqrt{5}-1)/2$, certified by a degree-17 polynomial $f$ and a degree-13 polynomial $g$.","For any $n$ and $N$, a candidate configuration together with certificates $(f,g)$ satisfying Theorem 3 suffices to prove global optimality, so the Tammes problem reduces to an explicit polynomial-construction task.","When $N=f^{\\#}$, Lemma 2 forces the certificate $f$ to vanish on every pairwise inner product, so a valid certificate encodes the full distance distribution of the optimal configuration."],"supporting_citations":[{"why":"Supplies the spherical-code linear programming bound that Theorem 3 builds on.","marker":"[10]"},{"why":"Generalizes the linear-programming bound for packings on the sphere, cited as the extension of the principal theorem.","marker":"[12]"},{"why":"Provides the positive-definiteness lemma for Gegenbauer polynomials used in the proof of Lemma 2.","marker":"[20]"},{"why":"Documents the positive definiteness of the Gegenbauer kernel on the sphere, the same fact underlying Lemma 2.","marker":"[29]"}],"fun_headline_variants":["Polynomial certificates settle Tammes optima","LP yields exact distances for sphere arrangements","Optimal Tammes sets proven by linear programming","Tammes problem: new exact solutions via LP","Certified optimal point sets on spheres"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"For the 600-cell example, the load-bearing premise is that the displayed high-degree polynomials $f$ and $g$ have all nonnegative Gegenbauer coefficients, are nonpositive on the required intervals, and satisfy the exact identities $f^{\\#}=120$ and $120>g^{\\#}$; these identities are asserted by direct calculation without a demonstrated proof certificate.","fun_headline_variants_meta":{"raw":{"variants":["Polynomial certificates settle Tammes optima","LP yields exact distances for sphere arrangements","Optimal Tammes sets proven by linear programming","Tammes problem: new exact solutions via LP","Certified optimal point sets on spheres"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000203,"raw_usage":{"total_tokens":1381,"prompt_tokens":933,"completion_tokens":448,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":549,"completion_tokens_details":{"reasoning_tokens":379}},"tokens_in":549,"tokens_out":448,"duration_ms":4912,"temperature":1.0,"reasoning_tokens":379,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T13:38:11.074844+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Expand the displayed $f$ and $g$ in the Gegenbauer basis and check every coefficient for nonnegativity in exact arithmetic, or evaluate $f(t)$ on $[-1,(\\sqrt{5}+1)/4]$ at high precision and test the identity $f(1)=120\\,c_0$; a single failed coefficient sign, a single positive value on the interval, or a mismatch in $f^{\\#}$ would refute the 600-cell example.","supporting_citations":[{"cited_title":"Delsarte, J","cited_arxiv_id":null,"evidence_quote":"Supplies the spherical-code linear programming bound that Theorem 3 builds on."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Generalizes the linear-programming bound for packings on the sphere, cited as the extension of the principal theorem."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the positive-definiteness lemma for Gegenbauer polynomials used in the proof of Lemma 2."},{"cited_title":"Zong, Sphere packings, Springer-Verlag, New York, ( 1999)","cited_arxiv_id":null,"evidence_quote":"Documents the positive definiteness of the Gegenbauer kernel on the sphere, the same fact underlying Lemma 2."}],"review_version":1}