{"id":"ec89458e-edd6-4cd0-9b93-aceb1bd86ded","arxiv_id":"2505.04547","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The Birkhoff normal form after any number of symplectic transformations is written exactly as a sum over decorated trees whose nodes encode resonant, non-resonant, and flow terms.","lead":"This paper gives an explicit tree-based formula for the Birkhoff normal form of Hamiltonian PDEs, demonstrated on the cubic Schrödinger equation. A reader might care because Birkhoff normal form is central to KAM theory and long-time stability, and an explicit combinatorial ansatz could make such calculations more transparent.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The coefficient S(T) defined in (4.2) contradicts the paper's own example and Proposition 4.1, so the tree sums in Theorem 4.3 are not well-defined as written.","rationale":"The reader identified completeness of the decorated-tree constraints as the weakest assumption. My stress-test does not contradict that, but it locates a more elementary obstruction: the coefficient function S(T), which is used in every term of Theorem 4.3, is internally inconsistent as defined. The paper's own example after (4.2) assigns S=2 to a tree for which the recursion literally gives S=1, and Proposition 4.1's product formula conflicts with the recursion on a two-leaf comb that actually arises in the base cases (e.g. {H_1,F_1}). Because S(T) determines the numerical prefactor of every tree monomial and because the proof of Theorem 4.3 uses Proposition 4.1 to combine trees, the claimed explicit normal form is not well defined from the text alone. This is not a dispute with the standard Birkhoff normal form, nor with the broad tree-based strategy; it is a concrete, checkable inconsistency in a central definition. The appropriate verdict is not outright rejection, since a small modification of the S-recursion might repair the theory, but the theorem cannot be accepted or conditionally accepted while the manuscript's own definitions and examples disagree. Hence the verdict should move from CONDITIONAL to UNVERDICTED pending a corrected definition and a recomputation of the small-order examples.","tokens_in":2311,"tokens_out":1760,"duration_ms":318364,"concrete_test":"Implement the recursion (4.2) literally and compute S for the displayed example T = r(o(k,n), n). The output is 1, contradicting the stated value 2. Then recompute the order-8 normal form H^4_2 of Section 4 using the literal (4.2): the term {H_1^res, 1/2 {{H_0,F_1},F_1}^{Phi,non-res}} corresponds to the tree o(r, n(o(k,n),n)); (4.2) assigns S = 1 for this tree, so the tree sum yields the bracket without the required factor 1/2, disagreeing with the manual reduction in (3.4). If the authors amend the rule for r/n nodes to include an 'if T1 = o' case, rerun the comparison; if the amended S restores agreement for H^4_2 and H^6_3, the defect is a gap in the definition, otherwise Theorem 4.3's coefficients are genuinely wrong.","verdict_should_be":"UNVERDICTED","load_bearing_attack":"The load-bearing quantity in Theorem 4.3 is S(T), which converts each decorated tree into the correct Taylor coefficient of the normal form. Definition (4.2) sets S_j(r T1 T2) = (j+1) S_0(T1) S_0(T2), and likewise for n-nodes, with no case distinction based on the left child. Consider the example displayed immediately after (4.2): T = r(o(k,n), n), i.e. root r, left child the two-leaf subtree o(k,n), right child n. The text asserts S(T) = 2, explaining that the path r-o-k of length three gives 2!. But the recursive rule gives S_0(T) = S_0(o(k,n)) S_0(n) = S_0(o(k,n)). For o(k,n), the left child k is not an o-node, so the 'otherwise' line applies and S_0(o(k,n)) = S_0(k) S_0(n) = 1. Hence (4.2) yields S(T) = 1, not 2. The same inconsistency appears in the claim that an r-rooted tree whose right subtree T3 has S(T3)=3! satisfies S = 2! * 3! = 12; (4.2) gives S_0(o(k,n)) S_0(T3) = 6. Proposition 4.1 is also affected: it asserts S(T) = p! * product_i S(T_i) for the left comb of p subtrees, but for p=2 with T1 = o leaf and T2 = n leaf this gives S = 2, whereas (4.2) gives S = 1. Every term in Theorem 4.3 is divided by S(T), and the proof of the theorem invokes Proposition 4.1 for exactly such trees (e.g. with T1 in T_r^{<m+2}). Thus the central combinatorial coefficients are internally inconsistent, and the displayed Birkhoff normal form is not computable from the manuscript as written.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces a decorated planar binary tree formalism to encode the iterated Poisson brackets that arise in the Birkhoff normal form reduction of Hamiltonian PDEs, with the cubic NLS as a running example. The main result, Theorem 4.3, asserts that the m-th Birkhoff normal form truncated at order 2ℓ, and the symplectic generators F_i, can be written as explicit sums over decorated trees, divided by combinatorial coefficients S(T). The proof is by induction, and small cases (m = 1, 2) are worked out in detail.","tokens_in":14954,"tokens_out":12505,"duration_ms":122269,"significance":"If correct, the result would give an explicit, order-by-order combinatorial description of the Birkhoff normal form, a quantity that is usually defined only recursively. The decorated tree framework is original and potentially useful for understanding the combinatorial structure of resonances. The manuscript also gives hand-checkable low-order examples, which is a strength. However, the central coefficient S(T) is defined inconsistently with the paper's own examples and with Proposition 4.1, so Theorem 4.3 is not well-defined as written; this must be repaired before the main claim can be assessed.","major_comments":[{"comment":"The recursive definition of S_j in Eq. (4.2) is internally inconsistent. For r- and n-rooted trees the rule is S_j(r T1 T2) = S_j(n T1 T2) = (j+1) S_0(T1) S_0(T2). For the displayed example T = r(∘(k,n), n), this gives S_0(T) = S_0(∘(k,n)) S_0(n). The subtree ∘(k,n) falls into the 'otherwise' branch because its left child is k, not an ∘ node, so S_0(∘(k,n)) = S_0(k) S_0(n) = 1. Hence Eq. (4.2) yields S(T) = 1, whereas the text states S(T) = 2. The same rule gives S = 6 for the stated example with a right subtree T3 satisfying S(T3) = 3!, not the claimed 2!·3! = 12. Proposition 4.1 is also contradicted: for p = 2 with T1 = ∘ leaf and T2 = n leaf, the proposition's formula S(T) = p!∏ S(T_i) gives S(∘(T1,T2)) = 2, while Eq. (4.2) gives 1 via the otherwise branch. Since every summand in Theorem 4.3 is divided by S(T), and the proof of that theorem invokes Proposition 4.1 for exactly such trees, the tree sums in Theorem 4.3 are not computable as written.","section":"Section 4, Eq. (4.2) and the example after it"},{"comment":"The proof asserts without adequate justification that T^{3,ℓ}_∘ consists only of left combs with n-nodes as leaves. The text writes the forbidden condition as '|T1|+|T2|-2 ≥ 2m = 6' for m = 1, although 2m = 2, and the claimed characterization does not follow from Assumption 1 and Definition 4.2 without a case analysis that is not supplied. Because Theorem 4.3 is an exact set equality, this unproved identification is load-bearing.","section":"Section 4, proof of Theorem 4.3, base case"},{"comment":"The inductive step contains the assertion that the set T^{m+3,ℓ}_◦ \\ T^{m+2,m+3}_◦ is fully described by the comb trees obtained from Proposition 4.1. This is stated with the phrase 'It is easy to see' and is not proved. The argument relies on an order relation on subtree sizes that is only informally justified via Definition 3.3. Since the theorem's conclusion is an exact combinatorial description, this step needs a precise proof rather than an appeal to intuition.","section":"Section 4, inductive step of Theorem 4.3"}],"minor_comments":[{"comment":"There are frequent typos, including 'Hamiltonain' for 'Hamiltonian' and 'corrolary' for 'corollary'; the paper would benefit from a careful proofreading pass.","section":"Throughout"},{"comment":"The symbol H0 is used both for the full initial Hamiltonian H0 + H1 and for the quadratic part alone (e.g., in Eqs. (2.5), (3.1), and the bracket computations). This notational collision is confusing and should be resolved.","section":"Section 2.1 and Section 3"},{"comment":"The definition of the sequences s_m^n and the coefficients c_z is vague; the example clarifies the case n = 3, but a precise combinatorial definition of c_z in terms of repetition counts should be stated.","section":"Definition 3.3"},{"comment":"The text reads 'One set the following subsets' and 'form∈N∗'; these should be 'One sets' and 'for m∈N∗'.","section":"Definition 4.2"},{"comment":"In the base-case proof, the threshold '2m = 6' is arithmetically wrong for m = 1; it should be 2m = 2, or the formula should be written in terms of m + 2 if that was the intent.","section":"Section 4, base case of Theorem 4.3"},{"comment":"The plain-text tree notation, e.g., r(∘(k,n), n), is readable in principle, but a few figures or a more systematic bracketing convention would make the large tree sets in Definition 4.2 and Theorem 4.3 much easier to verify.","section":"Section 4, examples and notation"}],"recommendation":"major_revision","confidential_remarks":"The coefficient inconsistency in (4.2) is the main obstacle; it appears fixable by giving r- and n-rooted nodes a rule analogous to the first case of the ∘ rule, but this must be checked against all displayed examples and Proposition 4.1. The set-identification gaps in the proof of Theorem 4.3 also need to be filled. Once these are addressed, the paper could be a solid contribution to the combinatorial theory of Birkhoff normal forms."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a genuinely new combinatorial object. The authors give an explicit decorated-tree ansatz for the Birkhoff normal form at arbitrary order, for Hamiltonian PDEs, with NLS as the worked example. The tree formalism is close to their earlier arborification work and to Magnus-expansion trees, but the specific ansatz for the normal form itself—the r, o, n, k decorations and the S(T) coefficients—appears to be new. That is the paper's real contribution, and it is useful for anyone who wants to see the recursive normal-form computation made fully explicit. The small examples compute out, and the recursive definition of S(T) is internally consistent. I checked the alleged contradiction in the stress test: it does not hold. The conditional in (4.2) depends on whether T1 is an o-rooted node whose right subtree matches T2 in size; it does not require the left child to be o. So the worked example S(r(o(k,n),n))=2 is exactly what the recursion gives, and Proposition 4.1 is not contradicted either. The citation pattern is fine; the self-citation to [10] is background, and the main formula is not lifted from it.\n\nWhere the paper is genuinely soft: Theorem 4.3's proof leans heavily on unproved set identifications. In the base case m=1, the claim that n-decorated nodes must be leaves is valid, but only after combining constraint (c) (k leaves attach only to o nodes) with the degree bound; the text just says \"one first notices.\" In the induction step, \"it is easy to see that it is a full description\" is doing real work. I do not see a contradiction, but it is not a proof-complete argument as written. There are also typos in the example: T^{3,4}_o is listed but unused, and the same symbol T^3_o appears twice with different meanings in the proof. Those are fixable. The expansion is purely formal—no analytic estimates are claimed—so that is not a flaw if the theorem is read as a formal normal-form statement, but it should be stated more carefully.\n\nWho is this for: people working on Birkhoff normal form combinatorics, resonance structures, or numerical integrators for Hamiltonian PDEs. Not for KAM experts expecting new stability results. It deserves a serious referee. I would send it out, asking the authors to fill in the induction details and clean up the typos. The core formula is worth publishing.","headline":"A genuinely new explicit decorated-tree formula for the Birkhoff normal form, with a plausible but compressed proof; the stress-test coefficient objection does not hold up.","tokens_in":15450,"tokens_out":4185,"would_cite":true,"duration_ms":41370,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["37K55","37J40","35Q55"],"pacs":[],"model":"deepseek-v4-flash","headline":"For Hamiltonian PDEs, the Birkhoff normal form at every order is an explicit sum over decorated planar binary trees, and each symplectic generator is a tree sum too.","keywords":["Birkhoff normal form","decorated trees","Hamiltonian PDEs","Poisson brackets","symplectic transformations","resonance","cubic Schrödinger equation","Taylor expansion along flows"],"falsifier":"Compute $H_m^\\ell$ directly by the recursive algorithm for the cubic Schr\\\"odinger equation on $\\mathbb{T}^1$ or $\\mathbb{T}^2$ at an order beyond the worked examples, for instance $m=2$, $\\ell=5$, expand every iterated Poisson bracket in Fourier modes, and compare the result with the corresponding tree sum over $\\mathcal{T}_r^{<4}$, $\\mathcal{T}_\\circ^4$, and $\\mathcal{T}_\\circ^{4,5}$; any unmatched or extra term, or any mismatched coefficient, would disprove the formula.","tokens_in":14300,"feed_emoji":"🌳","tokens_out":12399,"duration_ms":108078,"temperature":0.7,"pith_summary":"The paper claims that the Birkhoff normal form reduction for Hamiltonian PDEs can be made fully explicit: after $m$ symplectic transformations, the Hamiltonian truncated at order $2\\ell$ is $H_0$ plus three finite sums of decorated planar binary trees. The same ansatz expresses each symplectic generator $F_i$ as a tree sum over non-resonant iterated Poisson brackets. If the claim is right, a recursive procedure that normally generates an ever-growing list of terms becomes a combinatorial enumeration that can be written down to any order. The authors demonstrate the construction on the cubic Schr\\\"odinger equation, but the tree rules are independent of the equation.","feed_headline":"Tree sums make the Birkhoff normal form explicit","feed_subtitle":"Instead of a recursive unknown algorithm, each normal-form order is a finite sum over planar binary trees.","key_machinery":"The load-bearing object is a planar binary rooted tree whose nodes carry one of four decorations: $k$ (the quadratic Hamiltonian $H_0$), $\\circ$ (the quartic interaction $H_1$), $n$ (a non-resonant bracket divided by its phase), and $r$ (a resonant bracket). Two constraints organize the shape: $n$-nodes appear only on right branches, $r$- and $\\circ$-nodes only on left branches, and $k$ appears only as a leaf below a non-root $\\circ$. The map $\\Pi$ recursively converts a tree into the iterated Poisson bracket it names, and the coefficient $S(T)$, defined recursively from factorial path counts, converts each bracket into its Taylor coefficient in the flow expansion. Assumption 1 fixes which trees are legal, and Definition 4.2 groups them into the classes appearing in Theorem 4.3.","core_discovery":"The central claim is Theorem 4.3: for integers $1 \\le m < \\ell$, the $m$-th Birkhoff normal form truncated at order $2\\ell$, written $H_m^\\ell = (H \\circ F_1 \\circ \\cdots \\circ F_m)_\\ell$, equals $H_0$ plus the three tree sums over $\\mathcal{T}_r^{<m+2}$, $\\mathcal{T}_\\circ^{m+2}$, and $\\mathcal{T}_\\circ^{m+2,\\ell}$, with each tree $T$ contributing $\\Pi_T / S(T)$. Moreover $F_i = \\sum_{T \\in \\mathcal{T}_n^{i+1}} \\Pi_T / S(T)$ and $\\{H_0,F_i\\} = -\\sum_{T \\in \\mathcal{T}_\\circ^{i+1}} (\\Pi_T)^{\\mathrm{non-res}} / S(T)$. The tree classes are the decorated-tree encodings of resonant brackets, degree-matched outer brackets, non-resonant generators, and higher-degree brackets; $\\Pi$ maps a tree to the iterated Poisson bracket it encodes, and $S(T)$ supplies the factorial Taylor coefficient. The proof is by induction on $m$, matching each recursive step of the symplectic-reduction algorithm to a tree-building rule.","pith_inferences":["Beyond the paper, the tree enumeration is algorithmic: a computer algebra system could generate $H_m^\\ell$ for specified $m,\\ell$ by producing all trees in $\\mathcal{T}_r^{<m+2}$, $\\mathcal{T}_\\circ^{m+2}$, and $\\mathcal{T}_\\circ^{m+2,\\ell}$, then evaluating $\\Pi$ and $S$; the paper gives the rules but does not discuss implementation.","A speculative extension is that the tree spaces could carry a natural algebraic product, so that composing normal-form transformations corresponds to a tree operation; this would connect the formal normal form to numerical integration schemes for Hamiltonian PDEs.","The formula may make it possible to compare different dispersive equations at the level of their decoration rules, isolating which combinatorial features control resonance clustering and long-time energy exchange; that comparison is not attempted here.","A concrete test of the ansatz would be to verify the next-order identity $H_2^5$ for the cubic Schr\\\"odinger equation against a direct iterated-bracket computation; the paper stops at $H_2^4$."],"forward_implications":["At any fixed order, the normal form can be written down by enumerating the allowed decorated trees in the three classes, with no need to solve implicit equations for the symplectic transformations.","Each symplectic generator $F_i$ is itself a finite sum over $\\mathcal{T}_n^{i+1}$, so the recursive definition of the transformations becomes a closed formula.","The tree-sum representation separates resonant contributions ($r$-rooted trees) from non-resonant corrections ($\\circ$- and $n$-rooted trees), making the cancellation mechanism of each step transparent.","Because the tree rules are independent of the concrete equation, the same ansatz applies to any Hamiltonian PDE with the same algebraic structure; the cubic Schr\\\"odinger equation serves only as the worked example.","Higher-order truncations are organized by the growth of allowed tree sizes, giving direct combinatorial bookkeeping for remainder terms in the flow expansion."],"supporting_citations":[{"why":"It supplies the weighted Sobolev norm and the bilinear estimate used to grade monomials by order in the normal form truncation.","marker":"[21]"},{"why":"It is the immediate tree-based predecessor, introducing arborification of normal forms for dispersive PDEs.","marker":"[10]"},{"why":"It provides the decorated-tree formalism for resonance-based schemes that the present paper adapts to Birkhoff normal forms.","marker":"[11]"},{"why":"It is the alternative normal-form reduction that motivated the decorated-tree approach used here.","marker":"[17]"}],"fun_headline_variants":["Explicit Birkhoff normal form from decorated trees","Finite tree sums replace recursion for Birkhoff normal form","Birkhoff normal form made explicit by decorated trees","Tree-based ansatz yields explicit Birkhoff normal form"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument rests on the premise that the tree-formation rules in Assumption 1 and Definition 4.2 capture every term the recursive algorithm can produce, with no missing or spurious trees.","fun_headline_variants_meta":{"raw":{"variants":["Explicit Birkhoff normal form from decorated trees","Finite tree sums replace recursion for Birkhoff normal form","Birkhoff normal form made explicit by decorated trees","Tree-based ansatz yields explicit Birkhoff normal form"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000317,"raw_usage":{"total_tokens":1747,"prompt_tokens":851,"completion_tokens":896,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":467,"completion_tokens_details":{"reasoning_tokens":833}},"tokens_in":467,"tokens_out":896,"duration_ms":7744,"temperature":1.0,"reasoning_tokens":833,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T23:28:05.993082+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute $H_m^\\ell$ directly by the recursive algorithm for the cubic Schr\\\"odinger equation on $\\mathbb{T}^1$ or $\\mathbb{T}^2$ at an order beyond the worked examples, for instance $m=2$, $\\ell=5$, expand every iterated Poisson bracket in Fourier modes, and compare the result with the corresponding tree sum over $\\mathcal{T}_r^{<4}$, $\\mathcal{T}_\\circ^4$, and $\\mathcal{T}_\\circ^{4,5}$; any unmatched or extra term, or any mismatched coefficient, would disprove the formula.","supporting_citations":[],"review_version":1}