{"id":"74117991-264f-4cd3-8c85-c94bdc149141","arxiv_id":"1908.02752","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For sums of N increasing real sequences, the paper determines the maximal multiplicity of the k-th sum exactly for N=2 and proves a lower bound for N=3.","lead":"This paper asks how many different ways the k-th energy level of a system of N non-interacting one-dimensional quantum particles can be realized, and computes the maximum over all possible single-particle spectra. It gives an exact answer for two particles, a lower bound for three, and examples showing the general problem is hard.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The lower bound in Theorem 7.2 is presented as a 'scheme' rather than a completed induction; §12.4's exact identities appear to fill the gap, but the manuscript never assembles them into a proof covering every interval I_{j,ℓ}.","rationale":"Good faith reading: the exact N=2 theorem is sound; monotonicity is actually immediate from a maximizer having multiplicity at least 2, so Section 4's complications are unnecessary but harmless. The genuine soft spot is Theorem 7.2: Section 9 calls its general step a 'scheme' and contains at least one indexing slip, so a skeptical reader cannot verify the claimed coverage of all intervals I_{j,ℓ}. I do not believe the theorem is false: §12.4's formulas are exact and, once organized by the r-construction above, prove all intervals uniformly. The reader identified the same gap; the CONDITIONAL verdict is appropriate because the paper should be revised to replace the scheme by this induction. The conjectural equality and the unsupplied numerical code are secondary and do not affect the stated lower-bound theorem.","tokens_in":15835,"tokens_out":26485,"duration_ms":269924,"concrete_test":"Complete the missing induction explicitly: for each j≥2 and r∈{0,...,j}, set J=j+1 and let A^(r) have rows (0,1,2,...), (0,1,2,...), and (0,1,...,r-1,r+1,r+2,...). Using the counting in §12.4, compute the multiplicity of energy J as M_J-(J-r+1)=M_j+r and the number of eigenvalues below J as kmin(J)-1-c(J-r); verify this matches the r-th interval I_{j,r} in §7 and that M_j+r ≥ |I_{j,r}| for all r. Check j=2,3,4 and note that the formulas are independent of j, so no new coincidences can appear for larger j.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central lower bound m_k(3) ≥ m(k,Ahar_3) is not, as written, fully proved. Section 9.1 and 9.2 establish the first two jumps; Section 9.3 then says 'This gives the scheme for the general proof' and, using monotonicity, asserts the bound on I_{j,j-2}. No induction over ℓ is written down, and the parenthetical in §9.2 ('delete the (k-2)-th term') is index-confused: for k=kmin(j+1) the value deleted is λ_{k-1}-1=j-1, which is the j-th row entry, not the (k-2)-th. The saving fact is that §12.4 gives exact identities (12.11)-(12.12): deleting the value j-ℓ from the last row lowers the multiplicity of energy j by exactly ℓ+1 and lowers the first label by c(ℓ)=ℓ(ℓ+1)/2. These are exact counts, so unlisted coincidences cannot occur. What is missing is the explicit assembly: for J=j+1 and r=0,...,j, the matrix whose last row is N\\{r} has first label kmin(J)-c(J-r) and multiplicity M_j+r, which is precisely the value m(k,Ahar_3) on I_{j,r}; since that multiplicity exceeds the interval length, all k in the interval inherit the bound. Until such an induction is written out, Theorem 7.2 rests on a scheme rather than a proof.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper studies the maximal possible multiplicity m_k(N) of the k-th eigenvalue of the spectrum of a sum of N independent increasing sequences (rows), a combinatorial model for Schrödinger operators with separable variables. The main results are: (i) Theorem 6.1 gives the exact formula m_k(2)=floor((1+sqrt(8k-7))/2) via a lattice-point counting argument; (ii) Theorem 7.2 asserts the lower bound m_k(3) >= m(k,Ahar_3), where Ahar_3 is the harmonic-oscillator matrix with rows (0,1,2,...); (iii) for N=4, the paper proves m_4(4)=5 and m_5(4)=7, showing that the harmonic-oscillator matrix is not always the maximizer, and it gives numerical lower bounds for larger k. Section 12 develops exact multiplicity formulas for matrices obtained by deleting one entry from the last row of the harmonic oscillator. The paper also states a monotonicity theorem for m_k(N) and discusses the difficulty of the general problem.","tokens_in":16145,"tokens_out":12807,"duration_ms":118659,"significance":"If the proofs were complete, the N=2 exact formula would be a clean closed-form result, and the N=3 lower bound would provide strong evidence for the conjectured optimal multiplicities. The paper is commendable for making the constructions explicit and for identifying that the harmonic-oscillator matrix is not a universal maximizer; the decomposition formulas (12.11)-(12.12) are exact and could serve as a basis for a complete proof. No free parameters or fitted numerics are used in the theorems; the small cases N=3,4 are proved by direct case analysis. However, the proof of the central N=3 lower bound is presented as a scheme rather than a completed induction, and the monotonicity theorem used to propagate bounds is only sketched, so the paper needs substantial revision before the main claim is fully established.","major_comments":[{"comment":"The proof of Theorem 7.2 is not completed. Section 9.3 states 'This gives the scheme for the general proof of the theorem' after treating only the first two jumps, and no induction over ell is written. Equations (12.11)-(12.12) provide exact identities for the multiplicity and minimal labelling when j-ell is deleted from the last row, but the manuscript never assembles them into a proof covering every interval I_{j,ell}. The missing step is: for J=j+1 and r=0,...,j, the matrix Ahar_3 with last row N\\{r} has minimal labelling for eigenvalue J equal to kmin(J)-c(J-r) and multiplicity M_j+r, which is exactly m(k,Ahar_3) on I_{j,r}; since the block of equal multiplicity extends beyond that interval, all k in I_{j,r} inherit the bound. Until this assembly is written out, Theorem 7.2 rests on a scheme rather than a proof.","section":"Section 9.3 and Section 12.4"},{"comment":"The proof of the monotonicity theorem is only sketched and the notation is confused. The construction modifies a row by 'a_j_i into a_j_i-epsilon' and then 'shift a_j_i+1 into a_j_i', but it is not specified which entry remains in the row, and the claims about the new eigenvalue positions (the three bullet points) are asserted without verification that no other sums enter the relevant intervals. Since Theorem 1.3 is invoked in Section 9.3 to propagate the lower bound from a minimal label to the whole interval I_{j,ell} and in Section 10.2 for the N=4 bounds, this proof needs to be made rigorous.","section":"Section 4 (Theorem 1.3)"}],"minor_comments":[{"comment":"The text refers to 'Conjecture 1.2' but the conjecture about integer entries is numbered Conjecture 1.4; please correct the cross-reference.","section":"Section 7 (after Theorem 7.2)"},{"comment":"The parenthetical 'delete the (k-2)-th term' is index-confused: for k=kmin(j+1), the value deleted is j-1, not k-2; the surrounding text should clarify that the deletion is of the entry lambda_{k-1}-1.","section":"Section 9.2"},{"comment":"In the displayed matrix at the start of Section 11.1, the last row is written as '0 d2 d3 d4 ... c_s ...' with a c_s typo; it should be d_s.","section":"Section 11.1"},{"comment":"The decomposition formula mu(j,Ahar_4)=sum_{ell=0}^j mu(j-ell,Ahar_3) is stated without proof; a one-line derivation from the last-row expansion would be helpful.","section":"Section 12.1"}],"recommendation":"major_revision","confidential_remarks":"The paper is honest about the gap ('scheme'), and the exact identities in Section 12.4 strongly suggest the gap is fillable. I recommend major revision rather than rejection. The novelty is moderate; the main interest is the exact N=2 formula and the counterexample to the harmonic-oscillator maximizer."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First, what's actually new. The exact N=2 formula is a clean counting argument and settles that case. The N=3 lower bound via the deletion/shift construction is new, and the underlying exact counts in (12.11)-(12.12) are the right tool. The N=4 example that beats the harmonic oscillator is a genuine counterexample, and the small-k values for N=3 and N=4 are honest case analysis.\n\nThe biggest flaw is not the math but the notation. The paper redefines m(k,Ahar_3) in (7.5) as a sequence that increases by 1 across the interval between consecutive minimal labels. That is not the multiplicity of the k-th eigenvalue of Ahar_3 as defined in Definition 1.1. For instance, Ahar_3 has λ_4 = 1 with multiplicity 3, but (7.5) gives m(4,Ahar_3) = 4. So Theorem 7.2, as written, is ambiguous: the left side is the true maximum and the right side is a newly defined object wearing the same symbol. This needs fixing, either with a different symbol or an explicit 'slight abuse of notation.'\n\nSecond, the proof of Theorem 7.2 is not fully written. Section 9.3 says 'this gives the scheme' and stops. The stress-test note is right that §12.4 contains the exact identities that would complete the induction, but the manuscript never assembles them into a proof covering every interval I_{j,ℓ}. I suspect the gap is mechanical: for J=j+1 and each ℓ, the matrix with the last row missing J-ℓ has its J-th eigenvalue at label kmin(J)-c(ℓ) with multiplicity M_J-(ℓ+1), and monotonicity then covers the interval. But 'suspect' is the point; the reader should not have to reconstruct this.\n\nThe citation pattern is fine. No fitted parameters, no circularity. The numerical tables are not shipped, but the proven results do not depend on them.\n\nWho gets value from this? Spectral theorists working on multiplicity bounds for sums of one-dimensional operators, and combinatorialists interested in sum-of-sequences problems. It is niche but the techniques are reusable.\n\nVerdict: this deserves peer review. A serious referee can see the core is right and the gaps are fillable, but it needs a revision that fixes the notation and writes out the induction properly before I'd trust the statement of Theorem 7.2.","headline":"The N=2 result is exact and nice; the N=3 lower bound is likely right but the paper redefines m(k,Ahar_3) in a confusing way and leaves the induction as a scheme.","tokens_in":16685,"tokens_out":18162,"would_cite":true,"duration_ms":158640,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05A05","15A18","81Q10"],"pacs":[],"model":"deepseek-v4-flash","headline":"For two rows, the k-th eigenvalue has at most floor((1+sqrt(8k-7))/2) representations, and this is sharp.","keywords":["maximal multiplicity","separable variables","harmonic oscillator","sumset spectrum","non-interacting particles","eigenvalue multiplicity","increasing sequences","spectral theory"],"falsifier":"Compute the full spectrum of Ahar_3 before and after deleting a chosen entry j-ell from the third row for a moderately large j, say j=10, and compare the multiplicity drop of level j with ell+1; if any other level changes multiplicity, the induction scheme in Section 9 fails at that point. Alternatively, an exhaustive integer search for a three-row matrix with m_6(3) at least 7 would disprove the proposed equality conjecture, though not the lower-bound theorem.","tokens_in":15640,"feed_emoji":"🔢","tokens_out":8548,"duration_ms":90567,"temperature":0.7,"pith_summary":"The paper asks: given N increasing sequences of real numbers, consider all sums obtained by picking one number from each sequence, and list them in increasing order. How many different representations can the k-th value in this list have, and what is the maximum possible over all choices of sequences? The authors answer this completely for N=2, where the maximal multiplicity is floor((1+sqrt(8k-7))/2). For N=3 they prove that the multiplicity is always at least the multiplicity obtained from the three-row harmonic-oscillator matrix, whose rows are 0,1,2,..., by a deletion-and-shift construction, and they verify the first five values exactly. The case N=4 already shows the harmonic oscillator is not always the best choice: the fourth eigenvalue can have multiplicity 5, one more than the oscillator gives.","feed_headline":"N=2: k-th level max multiplicity is floor((1+sqrt(8k-7))/2)","feed_subtitle":"For N=3 the harmonic-oscillator matrix sets a lower bound; N=4 already shows it is not optimal.","key_machinery":"The load-bearing object is the harmonic-oscillator matrix Ahar_N, whose n-th row is 0,1,2,...; its spectrum is the usual isotropic oscillator spectrum and provides the baseline lower bound. For N=3 the proof runs on a deletion-and-shift operation in the last row: replacing the entry j-ell by the next entries and shifting the tail changes the multiplicity of level j by a known amount, with formulas (12.11)-(12.12) giving the drop as ell+1 and the label shift as a sum of two-row multiplicities. For N=2 the machinery is a lattice-point count on the antidiagonal: a multiplicity m at sum lambda places m points on the line x+y=lambda, and the crossings below lambda are exactly m(m-1)/2.","core_discovery":"The central discovery is that the maximal multiplicity m_k(N) of the k-th eigenvalue is governed by a simple counting identity for N=2 and by a row-deletion mechanism for N>=3. For N=2, m distinct representations of the same sum force m(m-1)/2 distinct smaller sums, giving the exact bound. For N=3, starting from the harmonic-oscillator matrix Ahar_3 whose rows are 0,1,2,..., one can delete the entry j-ell from the last row and shift the later entries; this lowers the multiplicity of the level j by exactly ell+1 and moves its first occurrence to an earlier label, so that for every k the maximal multiplicity is at least m(k,Ahar_3). The authors also compute m_1(3),...,m_5(3) = 1,3,3,4,6 and m_1(4),...,m_5(4) = 1,4,4,5,7, showing that for N=4 the harmonic maximizer is not optimal.","pith_inferences":["If the conjectured equality m_k(3)=m(k,Ahar_3) holds, then m_k(3) grows like a constant times k^{2/3}, while the general upper bound leaves a wider gap; the exact N=2 result suggests the true growth for fixed N may be k^{1-1/N}.","The deletion-and-shift construction is effectively a recipe for generating candidate maximizers by removing several entries from the last row; the paper's N=4 numerics indicate that no simple pattern governs which deletions are optimal, so further exact results may need a different organizing principle.","Because the problem is equivalent to non-interacting one-dimensional Schrodinger operators, each lower-bound matrix corresponds to potentials whose energy levels have prescribed degeneracies; the inverse-spectral results cited in the paper could turn these matrices into explicit operators, making the bounds physically realizable.","A testable computational extension is to check Conjecture 1.4, that integer sequences suffice for the supremum; if true, the problem reduces to a finite, though rapidly growing, search for each k and N."],"forward_implications":["For N=2, the maximal multiplicity has the exact closed form floor((1+sqrt(8k-7))/2), so it grows like sqrt(2k) and is attained by the two-row harmonic-oscillator matrix for every k.","For N=3, every k has m_k(3) at least m(k,Ahar_3); the proof covers all intervals between successive harmonic-oscillator levels, not only the first jumps.","The first five exact values for N=3 are 1,3,3,4,6, and for N=4 they are 1,4,4,5,7, with m_4(4)=5 exceeding the harmonic-oscillator value and m_5(4)=7 obtained by deleting 1 from the last row of Ahar_4.","Maximal multiplicity is nondecreasing in k: m_k(N) <= m_{k+1}(N) for every k and N.","Playing only on the last row of Ahar_N gives lower bounds for every N, such as m_{k-1}(N) >= m(k,Ahar_N) - N + 1 for the first jump, so the construction is uniform in N."],"supporting_citations":[{"why":"Supplies the known multiplicity formula for the isotropic harmonic oscillator that is the baseline for the lower-bound family Ahar_N.","marker":"[1]"},{"why":"Also used for the harmonic-oscillator spectrum and multiplicities, the family on which the N=3 lower-bound construction is built.","marker":"[2]"},{"why":"Sets the tensor-product notation that identifies the matrix spectrum with the non-interacting Schrodinger operator.","marker":"[6]"}],"fun_headline_variants":["Exact max multiplicity for N=2: floor((1+sqrt(8k-7))/2)","Lower bound from harmonic oscillators for N=3 spectra","Counting representations pins down max multiplicity for two particles","Maximal multiplicities: exact for N=2, lower bound for N=3","N=4 already shows harmonic maximizer is not optimal"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The N=3 proof assumes that deleting the entry j-ell from the third row of the harmonic-oscillator matrix and shifting later entries lowers the multiplicity of level j by exactly ell+1 and moves its first-occurrence label by the predicted amount, with no unintended coincidences changing any other eigenvalue.","fun_headline_variants_meta":{"raw":{"variants":["Exact max multiplicity for N=2: floor((1+sqrt(8k-7))/2)","Lower bound from harmonic oscillators for N=3 spectra","Counting representations pins down max multiplicity for two particles","Maximal multiplicities: exact for N=2, lower bound for N=3","N=4 already shows harmonic maximizer is not optimal"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001468,"raw_usage":{"total_tokens":5977,"prompt_tokens":1093,"completion_tokens":4884,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":709,"completion_tokens_details":{"reasoning_tokens":4789}},"tokens_in":709,"tokens_out":4884,"duration_ms":38641,"temperature":1.0,"reasoning_tokens":4789,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:41:00.534851+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the full spectrum of Ahar_3 before and after deleting a chosen entry j-ell from the third row for a moderately large j, say j=10, and compare the multiplicity drop of level j with ell+1; if any other level changes multiplicity, the induction scheme in Section 9 fails at that point. Alternatively, an exhaustive integer search for a three-row matrix with m_6(3) at least 7 would disprove the proposed equality conjecture, though not the lower-bound theorem.","supporting_citations":[{"cited_title":"Cameron, Combinatorics: Topics, Techniques, Algorithms","cited_arxiv_id":null,"evidence_quote":"Supplies the known multiplicity formula for the isotropic harmonic oscillator that is the baseline for the lower-bound family Ahar_N."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Also used for the harmonic-oscillator spectrum and multiplicities, the family on which the N=3 lower-bound construction is built."},{"cited_title":"Reed and B","cited_arxiv_id":null,"evidence_quote":"Sets the tensor-product notation that identifies the matrix spectrum with the non-interacting Schrodinger operator."}],"review_version":1}