{"id":"4f97b885-1c21-40b3-a75b-0521d9beb2e9","arxiv_id":"1908.03914","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Weighted Catalan numbers satisfy the same 2-adic valuations as Catalan numbers under weaker conditions than previously known, and their periodicity modulo integers is fully characterized and applied to Morse link numbers.","lead":"By relaxing the conditions on how fast a weight function changes, this paper proves that weighted Catalan numbers keep the same divisibility by powers of 2 as ordinary Catalan numbers, and it pins down when such sequences repeat modulo a given integer. The results also settle conjectured periods for Morse link numbers modulo 7, 11, and powers of 3.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 2.1 hinges on a structural classification of minimal orbits (Theorem 2.5) that is cited, not proved; the parity reduction in Section 2.3 collapses if that classification or its unique-reversal half fails.","rationale":"The paper's main theorem is well argued as a combinatorial induction using orbit reductions. The weakest link is not a derivation inside the proof but the dependence on an external theorem, Theorem 2.5, which supplies both the structure of minimal orbits and the reversal used to count reductions. I agree with the reader's conditional verdict: once Theorem 2.5 is accepted, the central claim follows; the remaining risk is whether that theorem has been imported accurately and whether all of its consequences used in Section 2.3 are valid. I found no mathematical error in the surrounding proof: the parity bookkeeping in Lemma 2.10, the reduction factor in Lemma 2.11, and the base cases n = 1, 2 are internally consistent. The count of reduced orbits and the claim that the surviving orbits are exactly minimal orbits on k are plausible and supported by the structure of binary expansions, but they are asserted rather than fully proved in this paper. This does not warrant changing the verdict, but it does justify retaining the reader's CONDITIONAL assessment until Theorem 2.5 and its reversal half are independently verified.","tokens_in":18747,"tokens_out":33996,"duration_ms":369631,"concrete_test":"For n = 1 through 20, enumerate all binary trees on n vertices and their symmetry orbits; then verify (i) the minimal orbits are exactly those constructed by Theorem 2.5 from a black skeleton with s = s2(n+1)-1 vertices and complete trees whose depths are the exponents in n+1; (ii) the reversal rule 'white iff the two child subtrees are isomorphic' marks exactly the black skeleton vertices and yields a unique expansion of any minimal orbit on k = 2s or 2s+1 back to a minimal orbit on n; and (iii) the multiplicity f(O) = s!|O|/2^s, or (s+1)!|O|/2^s in the odd case, is an integer and is odd exactly when O is a minimal orbit on k. A single counterexample to (i)-(iii) would invalidate the reduction argument and hence the proof of Theorem 2.1.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 2.3 reduces the proof of Theorem 2.1 to the parity of the sum of epsilon_0 over minimal orbits on n vertices. The reduction step asserts that after replacing every attached complete binary tree by a single vertex, the reduced orbits that survive with odd multiplicity are exactly the minimal orbits on k vertices, and that each such reduced orbit has a unique black/white expansion back to a minimal orbit on n. This assertion is not derived in the paper; it is imported from Theorem 2.5, in particular the 'Furthermore' reversal statement (white iff the two child subtrees are isomorphic) and the resulting count f(O) = s!|O|/2^s for k = 2s, or (s+1)!|O|/2^s for k = 2s+1. If Theorem 2.5, or the specific reversal property used to count reductions, were false or inapplicable, the congruence sum_{O in U_min^n} epsilon_0^O = epsilon_0^{n-k} sum_{O in U_min^k} epsilon_0^O (mod 2) would not be justified and the induction to the base cases n = 1, 2 would break. I checked the internal steps of the proof, including Lemma 2.10's parity expansion, Lemma 2.11's reduction factor, and the base-case computations, and found no internal error; the weak point is exactly the degree to which the central claim rests on the cited orbit-structure theorem.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies arithmetic properties of weighted Catalan numbers C_n^b, which are sums over Dyck paths of products of weights b(height of an up-step). The main result (Theorem 2.1) replaces Postnikov and Sagan's sufficient condition 2^{n+1} | (Δ^n b)(x) for equality of 2-adic valuations by the weaker condition 2^n | (Δ^n b)(x) for all n ≥ 2 together with 4 | (Δ b)(x) and b(0) odd, proving ξ_2(C_n^b) = ξ_2(C_n) = s_2(n+1)-1. The proof introduces a map ε from a class of functions F with derivative divisibility conditions to binary sequences, analyzes parity of average weight functions on symmetry orbits of binary trees, and reduces the desired parity to a smaller case using the structure of minimal orbits. Section 3 states a generalization to q-ary trees and prime powers q (Theorem 3.1). Section 4 characterizes eventual periodicity of C_n^b modulo m (Theorem 4.2) and applies the results to Postnikov's conjectures on Morse link numbers, computing periods modulo 7 and 11 and showing that the period modulo 3^r divides 2·3^{r-3}.","tokens_in":19007,"tokens_out":13373,"duration_ms":131697,"significance":"If the proofs are completed, Theorem 2.1 is a genuine weakening of the known sufficient condition for the 2-adic valuation of weighted Catalan numbers to equal the classical Catalan valuation, and the ε-map is an elegant new tool for tracking parities of orbit averages. The periodicity theorem is a clean and complete characterization, and the applications to Morse link numbers explicitly resolve or partially resolve concrete conjectures of Postnikov. The paper is honest about open conjectures and includes helpful worked examples and tables. However, the manuscript is not fully self-contained: the central reduction in Theorem 2.1 relies on an unproved external orbit-structure theorem, Theorem 3.1 is only sketched, and Theorem 4.8 leaves a finite check to the reader. These gaps are fixable but currently limit verification.","major_comments":[{"comment":"The reduction step in the proof of Theorem 2.1 is load-bearing and rests on Theorem 2.5, which is not proved in the paper and is cited only by the phrase 'This was done more generally for q-ary trees by Konvalinka [6].' In particular, the assertion that after reduction the white vertices are exactly the leaves and the black vertices are exactly the internal vertices, and that this gives a unique expansion of a minimal orbit on k vertices to a minimal orbit on n vertices, is used essentially to justify the congruence Σ_{O∈U_min^n} ε_0^O ≡ ε_0^{n-k} Σ_{O∈U_min^k} ε_0^O (mod 2). The 'Furthermore' reversal half of Theorem 2.5 (white iff the two child subtrees are isomorphic) is needed for this uniqueness/existence argument. Please provide a proof of Theorem 2.5, or a precise citation of the exact statement in the literature, and include a proof of the reversal property.","section":"Section 2.3 (proof of Theorem 2.1)"},{"comment":"Theorem 3.1 is advertised as a strengthening of Konvalinka's result, but its proof is only a sketch. After Lemma 3.5 the text says 'The proof of Theorem 3.1 is quite similar to the proof of Theorem 2.1 from here' and omits the q-analog of Theorem 2.5, the reduction-counting formula analogous to f(O) = s!M/2^s, the parity determination modulo q, the uniqueness/existence argument for expanding a minimal q-ary orbit, and the verification of the base cases n ≤ q. These are not routine details because the parity reduction must now be performed modulo q rather than modulo 2. Please supply a complete proof or a precise statement of the relevant q-analog results with full references.","section":"Section 3 (Theorem 3.1)"},{"comment":"The proof of Theorem 4.8 leaves the phrase 'further verification of the finitely many remaining cases leaves the following pairs' without showing the actual finite check, and it eliminates the case (a,b) = (4,0) for semilength at least 2 by assertion. In addition, Lemma 4.10 is applied to the sequence f(n) with generating function x^{cβ}/((1-x)^a(1+x)^b), but Lemma 4.10 as stated assumes a linear recurrence with initial conditions a_1=⋯=a_{k-1}=0, a_k=1; the reduction of the shifted sequence f(cβ+n) to this form is not shown. Please provide the omitted finite verification and spell out the reduction to Lemma 4.10.","section":"Section 4 (proof of Theorem 4.8)"}],"minor_comments":[{"comment":"In the 'if' direction of the proof, 'suppose that n | b(0)···b(k)' should be 'm | b(0)···b(k)'.","section":"Section 4.1 (proof of Theorem 4.2)"},{"comment":"The statement contains an extra closing parenthesis: 'C_n^{(q)}(b))' should be 'C_n^{(q)}(b)'.","section":"Section 3 (Theorem 3.1 statement)"},{"comment":"The expression (2s-1)!! is used for s=0; please state the convention (-1)!!=1.","section":"Lemma 2.3"},{"comment":"The claimed stronger result under the weaker condition 2 | Δb is stated without proof; please add a sentence explaining how the same induction verifies the base cases n=1 and n=2 in that case.","section":"End of proof of Theorem 2.1"},{"comment":"The sentence 'This implies with this generating function may be written as' is garbled; it should read something like 'This implies that the generating function may be written as'.","section":"Section 4.2 (proof of Theorem 4.8)"},{"comment":"Lemma 4.10 is cited to an unpublished preprint [2]; please provide a proof or a published reference.","section":"Lemma 4.10"}],"recommendation":"major_revision","confidential_remarks":"This appears to be an undergraduate research report with a clear and promising approach. The main concerns are all about completeness: the reliance on an unproved external orbit-structure theorem in the proof of Theorem 2.1, the sketchiness of Section 3, and the omitted finite check in Section 4. I do not recommend rejection because the central reasoning is credible and the gaps seem fillable within the scope of a revision. However, if the journal requires a high degree of self-containedness, the paper is not yet there."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Jake,\n\nThe paper is a genuine advance in the arithmetic of weighted Catalan numbers. The main theorem relaxes Postnikov-Sagan's divisibility hypotheses: instead of 2^{n+1} | Δ^n b, they need 2^n | Δ^n b for n≥2, keeping 4 | Δb. The proof via the epsilon map and coin configurations is clever and, as far as I can tell, correct. I also like the clean iff criterion for eventual periodicity modulo m (Theorem 4.2) and the Morse link period computations; those settle two of Postnikov's conjectures.\n\nWhat is actually new: the epsilon invariant and the coin-configuration description of orbit reduction; Theorem 2.1; Theorem 4.2; the computations mod 7 and 11; and Theorem 4.8 bounding the period mod 3^r.\n\nThe soft spots are where the authors summarize instead of prove. Theorem 3.1 (the q-analog) is explicitly a sketch—\"proof is similar\"—and the details given are enough to convince me but not enough to verify line-by-line. Theorem 4.8 ends with a finite check left to the reader; the remaining cases are small, but a referee should ask for the table. The proof of Theorem 2.1 also leans on Theorem 2.5, the orbit-structure classification, which is cited from Konvalinka rather than proved here. The stress-test worry about that is real but not fatal: the uniqueness of the coloring is argued (children vs leaves), and the existence follows from the minimal-orbit property that leaves outnumber internal nodes by 0 or 1. I'd still like to see the \"direct verification\" expanded, because the parity reduction collapses if that part is wrong. It isn't, as far as I can tell.\n\nFor a reader in enumerative combinatorics, this is worth a careful reading. It deserves a serious referee; I'd send it out with minor-revision comments asking to expand the two sketched proofs and the finite check.","headline":"Genuinely relaxes Postnikov-Sagan's 2-adic divisibility conditions and resolves Postnikov's Morse link periodicity conjectures; the core combinatorial argument is solid, with two proof sketches that a referee should ask to be expanded.","tokens_in":19560,"tokens_out":17079,"would_cite":true,"duration_ms":154510,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05A15","05A19","05C05","11A07","11B50","11B65"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves a weaker sufficient condition under which weighted Catalan numbers have exactly the same 2-adic valuations as ordinary Catalan numbers, and it extends the method to prime-power q-Catalan numbers and periodicity of…","keywords":["weighted Catalan numbers","2-adic valuation","finite differences","binary trees","symmetry orbits","q-Catalan numbers","periodicity modulo m","Morse links"],"falsifier":"Take $b(x)=4x+1$, which satisfies the hypotheses, and compute $\\xi_2(C_n^b)$ by enumerating all Dyck paths of semilength $n$; for $n=10$ the theorem predicts $\\xi_2(C_{10}^b)=s_2(11)-1=2$, so any other valuation refutes the central claim. Alternatively, enumerate the symmetry orbits of binary trees on a small $n$ and check that every orbit has size at least $2^{s_2(n+1)-1}$ and that the minimal orbits have exactly the predicted attaching structure.","tokens_in":2369,"feed_emoji":"🧮","tokens_out":5203,"duration_ms":104800,"temperature":0.7,"pith_summary":"This paper finds a weaker condition on the weight function $b$ under which every weighted Catalan number $C_n^b$ is divisible by exactly the same power of 2 as the ordinary Catalan number $C_n$. The condition asks that $b(0)$ be odd, that $\\Delta b(x)$ be divisible by 4 for every $x$, and that $\\Delta^n b(x)$ be divisible by $2^n$ for $n \\ge 2$; this weakens the earlier condition of Postnikov and Sagan, which required $2^{n+1}$ to divide the $n$-th difference. The proof encodes the residues of finite differences modulo powers of 2 into a parity sequence and tracks it over orbits of binary trees. The method extends to $q$-ary trees when $q$ is a prime power, and separately the paper characterizes when weighted Catalan numbers are eventually periodic modulo any integer, applying that to Morse link numbers.","feed_headline":"Catalan valuation survives weaker weight conditions","feed_subtitle":"New proof weakens divisibility hypotheses, reaches prime-power q-Catalan numbers, and fixes Morse-link periods.","key_machinery":"The central object is the parity map $\\varepsilon$ on the class $\\mathcal{F}$ of functions whose $n$-th finite differences are divisible by $2^n$. For $f\\in\\mathcal{F}$, the residue of $\\Delta^n f$ modulo $2^{n+1}$ is either $0$ or $2^n$, and $\\varepsilon_n(f)$ records which one occurs. For each orbit $O$ of binary trees under the symmetry group that exchanges left and right subtrees, the average weight function $r_b(O;x)=w_b(O;x)/|O|$ lies in $\\mathcal{F}$, and $\\varepsilon_0^O$ determines whether the orbit contributes an odd total weight. The explicit coin-configuration formula for $\\varepsilon_m^O$ expresses it as a sum over configurations of coins placed at vertices with no sibling edges selected, and the reduction lemma factors out powers of $\\varepsilon_0$ when complete binary subtrees are compressed to single vertices. Together with the structure theorem for minimal orbits, this machinery reduces the main theorem to a parity count on a smaller set of orbits.","core_discovery":"The central discovery is Theorem 2.1: if $b:\\mathbb{Z}_{\\ge 0}\\to\\mathbb{Z}$ has $b(0)$ odd, $4\\mid\\Delta b(x)$ for all $x$, and $2^n\\mid\\Delta^n b(x)$ for all $n\\ge 2$ and $x$, then $\\xi_2(C_n^b)=\\xi_2(C_n)=s_2(n+1)-1$ for every $n$. The proof computes $C_n^b$ modulo $2^{s+1}$, where $s=s_2(n+1)-1$, by grouping binary trees into symmetry orbits. Each orbit contributes a power of two times an average weight function, and those average functions live in a class closed under the operations used. A parity map detects which average weights are odd, and a coin-configuration formula describes the parity sequence of each orbit. A reduction lemma shows that replacing a complete binary subtree by a single vertex only multiplies the parity sequence by a fixed power of $\\varepsilon_0$, so the parity count on minimal orbits reduces to small base cases. Along the way, the authors note a sharper parity fact: if only $2\\mid\\Delta b$ is assumed, the equality with $\\xi_2(C_n)$ still holds for odd $n$, while even $n$ have strictly larger valuation when $4\\nmid\\Delta b$.","pith_inferences":["Because the $\\varepsilon$ map records residues of finite differences modulo powers of 2, it should also measure the failure $\\xi_2(C_n^b)-\\xi_2(C_n)$ when the hypotheses fail, not merely detect parity; a natural next step is to express that defect as a coin-configuration sum.","The same orbit-reduction method likely yields a combinatorial proof of Conjecture 2.14, replacing the computational criterion for polynomial weight functions with a structural tree argument.","For Morse links, the period bound of Theorem 4.8 narrows the verification of Postnikov's conjectured exact period $2\\cdot 3^{r-3}$ to checking that the two exceptional path classes do not cancel in the sum; a reader could test this numerically for small $r$."],"forward_implications":["For any weight function satisfying the three divisibility hypotheses of Theorem 2.1, $\\xi_2(C_n^b)=s_2(n+1)-1$ exactly, so the 2-adic valuation of the weighted Catalan number is pinned down.","If $b(0)$ is odd but only $2\\mid\\Delta b$ is assumed, equality with $\\xi_2(C_n)$ still holds for odd $n$, while for even $n$ the valuation is strictly larger exactly when $4\\nmid\\Delta b$.","For a prime power $q=p^k$, under the analogous hypotheses $b(0)\\equiv 1\\pmod q$, $q^2\\mid\\Delta b$, and $q^n\\mid\\Delta^n b$, the weighted $q$-Catalan numbers are congruent to the unweighted ones modulo $p^{\\xi+k}$, with $\\xi=(s_p((q-1)n+1)-1)/(p-1)$.","The sequence $\\{C_n^b \\bmod m\\}$ is eventually periodic if and only if $m$ divides $b(0)b(1)\\cdots b(k)$ for some positive integer $k$.","For Morse link numbers $L_n$, which are weighted Catalan numbers with $b(x)=(2x+1)^2$, the period modulo 7 is 12, modulo 11 is 55, and for $r\\ge 3$ the period modulo $3^r$ divides $2\\cdot 3^{r-3}$."],"supporting_citations":[{"why":"Supplies the recursive formula for average weight functions $r_b(O;x)$ and the earlier stronger sufficient condition that the new theorem weakens.","marker":"[9]"},{"why":"Provides the orbit-size lemma: every symmetry orbit on $n$-vertex binary trees has size $2^t$ with $t\\ge s_2(n+1)-1$.","marker":"[3]"},{"why":"Establishes the structure of minimal orbits of $q$-ary trees, which the paper adapts for the binary-tree reduction and generalizes to prime powers.","marker":"[6]"},{"why":"Gives the necessary and sufficient conditions for polynomial weight functions, motivating Conjecture 2.14 and the search for a weaker sufficient condition.","marker":"[1]"},{"why":"Provides the continued-fraction generating function for weighted Catalan numbers used in the periodicity theorem.","marker":"[5]"},{"why":"Defines Morse links and supplies the conjectures on periods of Morse link numbers that the paper resolves or partially resolves.","marker":"[8]"},{"why":"Supplies the known period of binomial-coefficient sums modulo a prime, used in the analysis of periods modulo 3 powers.","marker":"[7]"},{"why":"Provides the lemma that the period of a linear recurrence modulo $p^r$ divides $p^{r-1}$ times its period modulo $p$, used in the Morse link period proof.","marker":"[2]"}],"fun_headline_variants":["Weaker weight conditions still fix Catalan 2-adic valuations","2-adic valuations persist under weaker weight hypotheses","Odd n: Catalan 2-adic valuation survives weaker divisibility","q-Catalan valuations also fixed by parity-map argument","Periodicity key to Morse-link counts from weighted Catalan arithmetic"],"cache_read_input_tokens":21632,"weakest_assumption_plain":"The proof depends on the structural fact that symmetry orbits on binary trees with $n$ vertices have size at least $2^{s_2(n+1)-1}$ and that the smallest orbits are exactly the trees obtained by attaching complete binary trees with depths from the binary expansion of $n+1$ to an arbitrary smaller tree; if this structural fact failed, the parity count could break even though the hypotheses on the weight function still hold.","fun_headline_variants_meta":{"raw":{"variants":["Weaker weight conditions still fix Catalan 2-adic valuations","2-adic valuations persist under weaker weight hypotheses","Odd n: Catalan 2-adic valuation survives weaker divisibility","q-Catalan valuations also fixed by parity-map argument","Periodicity key to Morse-link counts from weighted Catalan arithmetic"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000809,"raw_usage":{"total_tokens":3539,"prompt_tokens":922,"completion_tokens":2617,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":538,"completion_tokens_details":{"reasoning_tokens":2535}},"tokens_in":538,"tokens_out":2617,"duration_ms":22042,"temperature":1.0,"reasoning_tokens":2535,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:58:10.254726+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $b(x)=4x+1$, which satisfies the hypotheses, and compute $\\xi_2(C_n^b)$ by enumerating all Dyck paths of semilength $n$; for $n=10$ the theorem predicts $\\xi_2(C_{10}^b)=s_2(11)-1=2$, so any other valuation refutes the central claim. Alternatively, enumerate the symmetry orbits of binary trees on a small $n$ and check that every orbit has size at least $2^{s_2(n+1)-1}$ and that the minimal orbits have exactly the predicted attaching structure.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the recursive formula for average weight functions $r_b(O;x)$ and the earlier stronger sufficient condition that the new theorem weakens."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the orbit-size lemma: every symmetry orbit on $n$-vertex binary trees has size $2^t$ with $t\\ge s_2(n+1)-1$."},{"cited_title":"Divisibility of generalized Catal an numbers","cited_arxiv_id":null,"evidence_quote":"Establishes the structure of minimal orbits of $q$-ary trees, which the paper adapts for the binary-tree reduction and generalizes to prime powers."},{"cited_title":"Combinatorial enumeration of weighted Catalan numbers","cited_arxiv_id":null,"evidence_quote":"Gives the necessary and sufficient conditions for polynomial weight functions, motivating Conjecture 2.14 and the search for a weaker sufficient condition."},{"cited_title":"Goulden and David M","cited_arxiv_id":null,"evidence_quote":"Provides the continued-fraction generating function for weighted Catalan numbers used in the periodicity theorem."},{"cited_title":"Counting morse curves and links","cited_arxiv_id":null,"evidence_quote":"Defines Morse links and supplies the conjectures on periods of Morse link numbers that the paper resolves or partially resolves."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the known period of binomial-coefficient sums modulo a prime, used in the analysis of periods modulo 3 powers."},{"cited_title":"Modular periodicity of linear recurrenc e sequences","cited_arxiv_id":null,"evidence_quote":"Provides the lemma that the period of a linear recurrence modulo $p^r$ divides $p^{r-1}$ times its period modulo $p$, used in the Morse link period proof."}],"review_version":1}