{"id":"9593595c-4f3e-4ec7-b06c-242c906619c5","arxiv_id":"1908.09051","paper_version":2,"verdict":"REJECT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"A max-plus analogue of the one-dimensional quantum walk is defined, but the proof of the central conservation theorem is invalid and the claimed one-point spectrum is contradicted by an explicit counterexample.","lead":"This paper introduces \"max-plus walks\", quantum-walk analogues where addition and multiplication become max and plus, and claims a conserved eigenvalue sum and a one-point spectrum for the evolution operator. The main theorem's proof contains a mathematical error, and the spectral claim is false under the natural definition.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 5.1's claim that σ(A)={0} is false: for a=−1, b=1, c=−1, d=1, the infinite max-plus walk matrix has a linear eigenvector with eigenvalue 1/2, so the spectral statement is not correct as written.","rationale":"The reader's REJECT verdict is supported, but the decisive load-bearing issue is not the fixable computation error in Theorem 4.1; it is the false spectral conclusion of Theorem 5.1. Recomputing the l=m eigenvalue shows the conservation criterion still follows with a corrected formula, so that concern would at most require a proof repair. The spectral claim, however, is contradicted by an explicit bi-infinite eigenvector with eigenvalue 1/2 for parameters satisfying assumption (A). This directly invalidates Section 5, the comparison in Table 2, and the abstract's spectral-analysis claim. A rejection is therefore warranted, with the path to a corrected version being to replace Theorem 5.1 by a precise spectral statement that either excludes unbounded linear eigenvectors or characterizes the full point spectrum of the infinite max-plus matrix. The reader identified the same issue in their weakest_assumption, so I partially agree; I would weight the spectral counterexample over the eigenvalue-formula error as the core reason for rejection.","tokens_in":14253,"tokens_out":13003,"duration_ms":110001,"concrete_test":"Set a=−1, b=1, c=−1, d=1 and define the bi-infinite vector v with two-component block x_k=(k/2, k/2−1). Verify directly that max(P⊗x_{k+1}, Q⊗x_{k−1}) = (1/2)+x_k componentwise for all k∈Z; if the equality holds, then 1/2∈σ(A) and Theorem 5.1 is false. A second check is to solve the general linear ansatz x_{k,L}=s k+p, x_{k,R}=s k+q in the recurrence, which forces s=1/2 and confirms the counterexample is not a numerical artifact.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The spectral theorem (Theorem 5.1) asserts σ(A)={0} for the infinite block tridiagonal max-plus matrix A in (5.14), by appealing to Proposition 2.2 on maximum average circuit weights. Proposition 2.2 is stated for finite matrices; it does not control bi-infinite eigenvectors that can carry nonzero eigenvalues on a noncompact graph. Under assumption (A), choose a=−1, b=1, c=−1, d=1, so P=[[−1,1],[−∞,−∞]], Q=[[−∞,−∞],[−1,1]], and the action is (A⊗x)_k = max(P⊗x_{k+1}, Q⊗x_{k−1}). Let x_k=(k/2, k/2−1). Then a direct max-plus computation gives (A⊗x)_k=((k+1)/2, (k−1)/2) = (1/2)⊗x_k for every k∈Z. Hence 1/2 is an eigenvalue of A in the ordinary max-plus sense, contradicting Theorem 5.1. The proof's line 'from proposition 2.2, the spectrum is obviously {0}' is therefore invalid for the infinite matrix. This is a false theorem, not a gap in an otherwise sound proof. By contrast, the conservation theorem may survive: correcting the balanced-case eigenvalue from min{ℓ,m,(ℓ+m−1)/2}Δ to min{ℓ,m}Δ still makes the sum nonconstant for Δ>0 and preserves the derived condition a+d=b+c=0. The spectral claim in Section 5 and Table 2, however, is demonstrably wrong.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces a max-plus analogue of the one-dimensional discrete-time quantum walk, with time evolution ψ_n^k = (P⊗ψ_{n-1}^{k+1}) ⊕ (Q⊗ψ_{n-1}^{k-1}) for 2×2 max-plus matrices P and Q. It gives an explicit path-sum formula for the state decision matrices A_n^k (Theorem 3.1), proposes that the sum over positions of the max-plus eigenvalues of these matrices is the analogue of the ℓ²-conservation of quantum walks, and states that this sum is conserved if and only if the entries of H=P⊕Q satisfy a+d=0 and b+c=0 (Theorem 4.1). The final part analyzes the infinite time-evolution operator A and asserts that its spectrum is the single point {0} (Theorem 5.1). The paper also gives an explicit eigenvector for this alleged eigenvalue 0.","tokens_in":14582,"tokens_out":7577,"duration_ms":73286,"significance":"The proposed model is a natural ultradiscrete analogue of a quantum walk, and the explicit path-sum formula in Theorem 3.1 is a useful, carefully derived contribution. The idea of using the sum of max-plus eigenvalues as a conserved quantity is original and connects the quantum-walk literature with max-plus spectral theory. If Theorem 4.1 were fully established, it would give a clean characterization of the conservative case. However, the central spectral claim of Section 5 is false as stated, and the proof of Theorem 4.1 contains a load-bearing eigenvalue error in the balanced case. Because the main advertised theorems are not correct as written, the paper cannot be accepted in its present form.","major_comments":[{"comment":"The displayed formula λ(A_n^k)=ℓa+md+min{ℓ,m,(ℓ+m−1)/2}Δ is incorrect when ℓ=m. In that case the simplified 2×2 matrix has diagonal entries min{ℓ,m}Δ = mΔ, and by Proposition 2.2 the eigenvalue is the maximum average circuit weight, i.e. mΔ, not (m−1/2)Δ. The paper's formula is obtained by averaging the two off-diagonal entries and ignores the self-loop contributions on the diagonal. Since the summation in the proof of Theorem 4.1 uses this formula, the necessity direction of that theorem is not proved as written. The corrected formula min{ℓ,m}Δ still makes the sum nonconstant for Δ>0, so the theorem may be repairable, but the proof needs a substantive correction.","section":"Section 4, eigenvalue formula following the Δ≥0 simplification"},{"comment":"Proposition 2.2 is stated for finite matrices and cannot be applied directly to the infinite block tridiagonal matrix A in (5.14). The assertion σ(A)={0} is actually false. Under assumption (A), take a=−1, b=1, c=−1, d=1 and define x_k=(k/2, k/2−1). A direct max-plus computation gives (A⊗x)_k = ((k+1)/2, (k−1)/2) = (1/2)⊗x_k for every k∈Z, so 1/2 is an eigenvalue of A. This contradicts Theorem 5.1 and the corresponding line of Table 2. The proof's statement that 'from proposition 2.2, the spectrum is obviously {0}' is invalid for an infinite matrix, since bi-infinite eigenvectors can carry nonzero eigenvalues without any finite circuit of that average weight.","section":"Section 5, Theorem 5.1"},{"comment":"The proof of Theorem 5.1 also depends on Proposition 2.3, a finite-matrix statement about columns of A^*, and on the infinite power series (5.15). No convergence or support condition is given that would justify passing from finite matrices to the bi-infinite matrix A. The counterexample in the previous comment shows that such conditions are not merely technical: the claimed eigenvector is not the only eigenvector, and the spectral conclusion fails.","section":"Section 5, proof of eigenvector formula"}],"minor_comments":[{"comment":"There are typographical errors such as 'weghted matrix' for 'weighted matrix'; the text should be proofread throughout.","section":"Section 2"},{"comment":"The sentence 'Since ξ_P, ξ_Q, ξ_R and ξ_S is not depend on w_k' is ungrammatical; it should read 'do not depend on'.","section":"Section 3, proof of Theorem 3.1"},{"comment":"The notation alternates between A_n^k for the max-plus state decision matrix and A_k^n for the quantum-walk matrix in (1.4); the different indexing conventions should be explained explicitly.","section":"Throughout"},{"comment":"The main eigenvalue formula and the summation formulas in Theorem 4.1 would be much easier to check if they were numbered; currently they appear only in displayed unnumbered equations.","section":"Section 4"}],"recommendation":"reject","confidential_remarks":"The counterexample to Theorem 5.1 is elementary and can be verified in a few lines, so the spectral part of the paper is not merely incomplete but false. Theorem 4.1 appears salvageable after correcting the balanced-case eigenvalue, but the manuscript in its present form cannot be recommended for publication."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a genuinely new construction — a max-plus analogue of the 1D quantum walk — and the explicit state-decision-matrix formula (3.10) is a real, checkable contribution. The conservation idea (summing max-plus eigenvalues of A_n^k) is nice, and the iff condition in Theorem 4.1 may actually be true. But Theorem 5.1 is wrong, and the proof of 4.1 contains an eigenvalue miscalculation that needs fixing even if the theorem survives.\n\nWhat's good: the model is not a re-coordinatization of something known. The direct path-sum derivation of (3.10) is careful, and the observation that it is the ultradiscretization of Konno's quantum-walk formula is worth putting on record. Under assumption (A), the eigenvalues -ka and the conserved sum 0 check out.\n\nSoft spots: in the Δ≥0 eigenvalue derivation, the paper averages the two off-diagonal entries to get min{ℓ,m,(ℓ+m-1)/2}Δ, but the max-plus eigenvalue of the 2×2 matrix is max of diagonal and half the off-diagonal sum. When ℓ=m, the diagonal entries are mΔ, which is larger than the average (2m-1)Δ/2. So the formula is wrong at k=0. The proof of 4.1 uses that wrong formula; the sum over k gets coefficient (n²-1)Δ instead of n²Δ. The conclusion still holds because the coefficient remains positive, but the proof needs revision, not just a typo.\n\nThe bigger problem is Section 5. Proposition 2.2 is a finite-matrix statement, and applying it to a bi-infinite matrix is invalid. For a=-1, b=1, c=-1, d=1 (which satisfies assumption A), x_k=(k/2, k/2-1) satisfies A⊗x = (1/2)⊗x. That is a direct contradiction to σ(A)={0}. So Theorem 5.1 and Table 2's spectral row are false as written. This is the load-bearing flaw of the paper's second half.\n\nCitation pattern is fine; the self-citation [27] is background and doesn't carry weight.\n\nBottom line: the model and the explicit formula are solid enough that a serious referee should look at this, but the paper needs substantial correction before it is publishable. The spectral claim must be fixed (or removed/qualified), and the eigenvalue proof in Section 4 must be redone. If those are addressed, the conservation result looks like it survives. Send it to a competent referee; it deserves a real review, not a desk reject.","headline":"A real new model and a mostly survivable conservation theorem, but Theorem 5.1 is false as stated; worth a careful referee, not acceptance.","tokens_in":15138,"tokens_out":6191,"would_cite":false,"duration_ms":55600,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["15A80","05C50"],"pacs":[],"model":"deepseek-v4-flash","headline":"In a max-plus walk, the sum over lattice positions of the state-decision-matrix eigenvalues is conserved exactly when the local coin satisfies $a+d=0$ and $b+c=0$, and the conserved sum is always zero.","keywords":["max-plus algebra","quantum walk","state decision matrix","conserved quantity","ultradiscretization","tropical eigenvalue","spectrum","directed graph"],"falsifier":"Take $a=d=0$, $b=c=1$ (so $\\Delta=2\\ge 0$), and look at $n=2$, $k=0$, where $\\ell=m=1$. The direct path sum $Q\\otimes P \\oplus P\\otimes Q$ is $\\begin{pmatrix}2 & 1 \\\\ 1 & 2\\end{pmatrix}$ in max-plus, whose eigenvalue is $2$; the paper's formula gives $0+0+\\min\\{1,1,1/2\\}\\cdot 2 = 1$. A reader who finds this discrepancy in the balanced case has falsified the eigenvalue identity on which the conservation criterion's proof depends.","tokens_in":14022,"feed_emoji":"🚶","tokens_out":13439,"duration_ms":113466,"temperature":0.7,"pith_summary":"Max-plus algebra replaces ordinary addition and multiplication by taking the maximum and adding, and this paper transplants the one-dimensional quantum walk into that setting. The resulting 'max-plus walk' has an explicit path-sum formula for the matrix that carries a state from time 0 to position $k$ at time $n$, and that matrix turns out to be exactly the ultradiscretization of the known quantum-walk amplitude. The paper's central result is a conservation law: the sum over all positions $k$ of the max-plus eigenvalues of these state-decision matrices does not change with time $n$ if and only if the walk's local coin entries satisfy $a+d=0$ and $b+c=0$, and in that case the conserved sum is identically zero. This condition plays the role that unitarity of the coin plays for the quantum walk's $\\ell^2$-norm conservation. The paper further shows that under this condition the whole-system time-evolution operator has spectrum $\\{0\\}$ with a spatially linear eigenvector, a far simpler spectral picture than the continuous unit-circle spectrum of the quantum walk.","feed_headline":"Max-plus walk conserves a sum of eigenvalues","feed_subtitle":"When a+d=b+c=0, the position-sum of state-matrix eigenvalues stays exactly zero as the walk evolves.","key_machinery":"The load-bearing tool is the max-plus eigenvalue of a $2\\times 2$ matrix, read off its weighted digraph: for $A=\\begin{pmatrix} p & q \\\\ r & s \\end{pmatrix}$ the eigenvalue is the maximum circuit mean $\\max\\{p, s, (q+r)/2\\}$, and with the state decision matrix $A_k^n$ this yields the closed form $\\lambda(A_k^n)=\\ell a+md+\\min\\{\\ell, m, (\\ell+m-1)/2\\}\\Delta$ for $\\Delta=(b+c)-(a+d)\\ge 0$ (and $\\ell a+md+\\Delta/2$ for $\\Delta<0$). Summing this formula over $k$ and requiring time-independence forces $\\Delta=0$ and $a+d=0$, which is exactly assumption (A); the same circuit-mean viewpoint, applied to the infinite matrix $A$ whose weighted digraph has maximum circuit mean $0$, produces the spectral claim $\\sigma(A)=\\{0\\}$.","core_discovery":"The paper establishes Theorem 4.1 as its main discovery: for the max-plus walk with local coin $P\\oplus Q$, where $P=\\begin{pmatrix} a & b \\\\ -\\infty & -\\infty \\end{pmatrix}$ and $Q=\\begin{pmatrix} -\\infty & -\\infty \\\\ c & d \\end{pmatrix}$, the quantity $\\sum_{k\\in\\mathbb{Z}} \\lambda(A_k^n)$ is independent of the time step $n$ if and only if $a+d=0$ and $b+c=0$, and the constant value of the sum is $0$. Under that assumption each individual eigenvalue collapses to $\\lambda(A_k^n)=-ka$, so the conservation is a linear cancellation of eigenvalues across symmetric positions. The supporting Theorem 3.1 gives the explicit max-plus expression of $A_k^n$ as a sum over paths, and Theorem 5.1 claims that the infinite time-evolution operator of the whole system has the single-point spectrum $\\sigma(A)=\\{0\\}$, with an eigenvector whose two components at position $k$ are $-ak$ and $(-k+1)a-b$, hence linearly growing in $k$.","pith_inferences":["The single-point spectrum $\\{0\\}$ suggests that the max-plus total evolution operator stabilizes after finitely many powers on any finite truncation; testing whether max-plus walks on finite graphs or with reflecting boundaries also conserve a zero sum would give a cheap, sharp check of the mechanism.","The linear-in-position stationary state invites comparison with the bounded, quadratically growing, and exponentially growing generalized eigenfunctions of quantum walks; one could test whether higher-dimensional max-plus walks produce stationary states that are linear along each coordinate direction.","If the announced max-plus analogue of the quantum-walk weak limit theorem holds, the conserved linear profile $\\lambda(A_k^n)=-ka$ suggests the limiting 'density' will be uniform on the interval between the extreme positions rather than the arcsine-like quantum density.","The same conserved-quantity construction could be applied to other ultradiscrete integrable walks, where the role of the coin is played by a transfer matrix; the conservation would then be a tropical analogue of a conserved charge of the dynamics."],"forward_implications":["Under assumption (A), the eigenvalue at position $k$ is $\\lambda(A_k^n)=-ka$, so the eigenvalue profile is a straight line in position with slope $-a$, independent of time $n$.","The conservation law $\\sum_k \\lambda(A_k^n)=0$ supplies a time-independent, position-resolved quantity in max-plus dynamics that plays the role of the $\\ell^2$-norm conservation in quantum walks, allowing a max-plus 'distribution' to be defined at each position.","The infinite time-evolution operator $A$ has spectrum $\\{0\\}$, meaning the whole-system dynamics are spectrally trivial yet admit stationary states that grow linearly in position.","The condition $a+d=b+c=0$ is equivalent to $\\operatorname{tropdet}(H)=0$ in max-plus, mirroring the determinant-1 condition for a unitary quantum coin.","Because $A_k^n$ is the ultradiscretization of the quantum-walk state decision matrix, the conservation law is an ultradiscrete shadow of the unitarity-driven $\\ell^2$ conservation of quantum walks."],"supporting_citations":[{"why":"Supplies the max-plus spectral graph machinery (eigenvalue as maximum circuit mean, eigenvector from maximum-weight path matrix) used to compute $\\lambda(A_k^n)$ and the spectrum of $A$.","marker":"[2]"},{"why":"Supplies the quantum-walk state decision matrix formula (1.4) of which the paper's $A_k^n$ is the ultradiscretization.","marker":"[10]"},{"why":"Supplies the ultradiscretization limit (1.1) that converts the quantum-walk recursion into the max-plus recursion and motivates the conserved-quantity analogy.","marker":"[26]"}],"fun_headline_variants":["Max-plus walk: eigenvalue sum conserved exactly","Conserved sum of eigenvalues in max-plus walk","Max-plus walk's eigenvalue sum: zero under a+d=0","Max-plus walk: sum of state-matrix eigenvalues invariant","Max-plus walk: eigenvalue sum conserved, spectrum {0}"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof of Theorem 4.1 relies on the closed-form eigenvalue formula $\\lambda(A_k^n)=\\ell a+md+\\min\\{\\ell, m, (\\ell+m-1)/2\\}\\Delta$ being valid for $\\Delta\\ge 0$ in every case, including the balanced case $\\ell=m$ where the formula omits the self-loop contribution $m\\Delta$ that the true eigenvalue includes.","fun_headline_variants_meta":{"raw":{"variants":["Max-plus walk: eigenvalue sum conserved exactly","Conserved sum of eigenvalues in max-plus walk","Max-plus walk's eigenvalue sum: zero under a+d=0","Max-plus walk: sum of state-matrix eigenvalues invariant","Max-plus walk: eigenvalue sum conserved, spectrum {0}"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001103,"raw_usage":{"total_tokens":4573,"prompt_tokens":891,"completion_tokens":3682,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":507,"completion_tokens_details":{"reasoning_tokens":3604}},"tokens_in":507,"tokens_out":3682,"duration_ms":28218,"temperature":1.0,"reasoning_tokens":3604,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:25:46.007786+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $a=d=0$, $b=c=1$ (so $\\Delta=2\\ge 0$), and look at $n=2$, $k=0$, where $\\ell=m=1$. The direct path sum $Q\\otimes P \\oplus P\\otimes Q$ is $\\begin{pmatrix}2 & 1 \\\\ 1 & 2\\end{pmatrix}$ in max-plus, whose eigenvalue is $2$; the paper's formula gives $0+0+\\min\\{1,1,1/2\\}\\cdot 2 = 1$. A reader who finds this discrepancy in the balanced case has falsified the eigenvalue identity on which the conservation criterion's proof depends.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the max-plus spectral graph machinery (eigenvalue as maximum circuit mean, eigenvector from maximum-weight path matrix) used to compute $\\lambda(A_k^n)$ and the spectrum of $A$."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the quantum-walk state decision matrix formula (1.4) of which the paper's $A_k^n$ is the ultradiscretization."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the ultradiscretization limit (1.1) that converts the quantum-walk recursion into the max-plus recursion and motivates the conserved-quantity analogy."}],"review_version":1}