{"id":"cefe940e-db40-425e-84ec-78e6314540f0","arxiv_id":"1908.06598","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Chromatic nonsymmetric polynomials of Dyck graphs are slide-positive, and their backstable limit recovers the known fundamental-basis expansion of chromatic quasisymmetric functions.","lead":"This paper proves that chromatic nonsymmetric polynomials of Dyck graphs expand as positive sums in the slide polynomial basis. The result links a recent nonsymmetric analogue of chromatic quasisymmetric functions to known symmetric-function expansions.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The expansion in Theorem 3.3 hinges on the omitted reverse case of Lemma 3.1; the gap is genuine but probably fillable, so the CONDITIONAL verdict stands unchanged.","rationale":"The paper's central claim is Theorem 3.3, and the proof strategy is sound in outline: partition ρ-restricted proper colorings by acyclic orientations, identify colorings compatible with each orientation o with ρ-restricted (P_o,ω_o)-partitions, decompose over linear extensions using Assaf-Bergeron, and apply Proposition 2.5 to each linear order. The only place where the proof's internal logic is less than fully explicit is Lemma 3.1. Lemma 3.2's hypothesis for Proposition 2.5 uses the forward direction of Lemma 3.1, and the index rdes is defined through the reverse direction, so both directions are load-bearing. The reverse direction's final case is explicitly omitted. I could not find a counterexample in small examples, and the lemma is plausible, but the paper itself marks this case as unproved. I also note that Lemma 3.5 is stated with no proof, but it is used only for the backstable-limit corollary, not for the central slide-positivity theorem; if the paper's goal is only Theorem 3.3, that omission is secondary. Since the concern is a missing derivation rather than a demonstrated contradiction, CONDITIONAL is the appropriate verdict, and supplying the missing case plus a small-case exhaustive check would justify acceptance.","tokens_in":13697,"tokens_out":21392,"duration_ms":198844,"concrete_test":"Run an exhaustive checker: for every partial Dyck path D∈P_{n,r} with n≤6 and every π∈S_n, compute both sides of Lemma 3.1 (P_D-descents of π and ascents of ω_o∘π, with ω_o from the stated algorithm) and additionally verify F(L_π,ω_o,ρ)=F_{rdes(L_π,ρ)}(x_r) by expanding both sides. A single mismatch identifies a false equivalence; if every case passes, the omitted case is a fillable exposition gap, and completing the derivation would justify moving from CONDITIONAL to ACCEPT.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Lemma 3.1 is the pivot: it lets Lemma 3.2 replace F(L_π,ω_o,ρ) by a single slide polynomial indexed by rdes(L_π,ρ), and Theorem 3.3 sums those slides. The reverse implication is not fully proved: after the incomparable case, the remaining case π(i+1)≻_P_D π(i) is dismissed with 'The argument for this is very similar to that presented in the proof of the forward direction. We omit the details.' The forward direction is a multi-step argument using the interval property of Dyck graphs, so the analogous reverse case is not immediate; it must rule out π(i+1)≻_P_D π(i) using the same Dyck-graph property in the opposite direction. If this equivalence fails for some D and π, the descent sets used to define rdes in (3.2) are wrong, and the equality in Lemma 3.2 can fail even if Proposition 2.5 is applied correctly. This is a proof gap rather than an observed false statement; the rest of the argument, assuming Assaf-Bergeron's results, is coherent.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies X_D(x_r;t), the chromatic nonsymmetric polynomial of a Dyck graph introduced by Haglund and Wilson, and proves that it expands positively in the basis of fundamental slide polynomials. The proof decomposes proper colorings according to the compatible acyclic orientation, identifies each orientation's contribution with a flagged (P,omega)-partition generating function in the sense of Assaf-Bergeron, and then uses Lemma 3.1 to show that each linear-extension piece collapses to a single slide polynomial indexed by a reduced weak descent composition depending only on the permutation pi and the restriction rho. The main result, Theorem 3.3, states that X_D(x_r;t) equals the sum over pi in S_n of t^{inv_G(pi)} F_{rdes(L_pi,rho)}(x_r). The paper then defines a backstable limit of slide polynomials, uses Lemma 3.5 to express backstable slides in terms of fundamental quasisymmetric functions, and derives the known Shareshian-Wachs expansion for the chromatic quasisymmetric function of Dyck graphs as Corollary 3.6. A final remark claims that Haglund-Wilson's key-positivity conjecture fails for some Dyck graphs on six vertices, though no example is given.","tokens_in":13951,"tokens_out":6648,"duration_ms":66922,"significance":"If the main theorem is fully established, the paper gives a uniform, parameter-free positive integral expansion of every chromatic nonsymmetric polynomial of a Dyck graph in the fundamental slide basis, a genuinely nonsymmetric analogue of fundamental-quasisymmetric expansions. The proof route through Assaf-Bergeron's flagged (P,rho)-partitions is natural and, modulo the gaps noted below, transparent. The backstable-limit argument also provides a new derivation of a known expansion for chromatic quasisymmetric functions, and the claimed counterexample to key-positivity would be a useful addition to the literature if it were explicitly exhibited. The derivation is not circular: the expansion is proved from external definitions, and the symmetric-function result is recovered as a consequence rather than assumed.","major_comments":[{"comment":"The reverse implication of Lemma 3.1 is incomplete. After ruling out the cases pi(i) not comparable to pi(i+1) in P_D and {pi(i),pi(i+1)} in E, the remaining case pi(i+1) succ_{P_D} pi(i) is dismissed with the sentence 'The argument for this is very similar to that presented in the proof of the forward direction. We omit the details.' This case is not a formal consequence of the forward direction, because the roles of pi(i) and pi(i+1) are not symmetric: the hypothesis is omega_o(pi(i)) < omega_o(pi(i+1)), and the forward proof uses the Dyck-graph interval property in a way that depends on which of the two vertices has the larger natural label. Since Lemma 3.1 is used in equation (3.2) to replace descents of omega_o composed with pi by P_D-descents, and since Lemma 3.2 and Theorem 3.3 depend on that replacement, the missing case must be proved in full.","section":"Section 3, Lemma 3.1"},{"comment":"The proof of Lemma 3.5 is omitted entirely, with the explanation that it is 'simply a matter of unraveling the definitions'. This lemma is the bridge from the backstable slide expansion to the fundamental-quasisymmetric-function expansion used in Corollary 3.6, so it is load-bearing for the paper's recovery of the Shareshian-Wachs result. A reader cannot verify the claimed gamma circle-dot delta and gamma dot delta decomposition from the text; please include a complete proof or a detailed derivation of the displayed expansion.","section":"Section 3.1, Lemma 3.5"},{"comment":"The paper states that 'we found counterexamples with Dyck graphs on 6 vertices' to Haglund-Wilson's key-positivity conjecture, but no counterexample is displayed or described. Because this assertion directly contradicts a published conjecture and is presented as a finding of the paper, the manuscript should include at least one explicit Dyck path D and the corresponding polynomial X_D(x_r;t) together with its key expansion. This example is not needed for Theorem 3.3, but it is needed for the remark to be verifiable.","section":"Section 4, Remark (2)"}],"minor_comments":[{"comment":"The equality F(L,omega,rho) = F_{2021}(x_4) + F_{1121}(x_4) is stated without explaining how the two slide polynomials arise from the linear extensions in Figure 4; a short indication of the two descent sets would help the reader check the definition of rdes.","section":"Section 2.5, equation (2.10)"},{"comment":"The theorem statement writes X_D(x;t) while the defining equation (2.2) and the expansion use the finite alphabet x_r; please reconcile the notation throughout the section.","section":"Theorem 3.3"},{"comment":"In the displayed expansion, the weak compositions F_{1|2}, F_{1|101}, and F_{11|1} are written without commas; although the convention is stated in Remark 2.1, using fully separated notation in this central example would improve readability.","section":"Section 3, equation (3.5)"},{"comment":"The 'folklore bijective correspondence' between strong compositions and subsets of [n-1] is invoked without a reference; citing a standard source, such as Stanley's Enumerative Combinatorics, would be helpful.","section":"Remark 2.4"}],"recommendation":"major_revision","confidential_remarks":"The omissions are real but appear localized and probably fillable. I recommend major revision rather than rejection: the authors should supply the missing case of Lemma 3.1 and a proof of Lemma 3.5, and should either exhibit the claimed key-positivity counterexample or soften the remark. The central slide-positivity theorem is credible and the paper is within the journal's scope."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know this paper first: it proves a genuinely new positive expansion for the chromatic nonsymmetric polynomial of a Dyck graph in the fundamental slide basis, and derives the known Shareshian–Wachs expansion of the chromatic quasisymmetric function as a backstable corollary. The method is a neat application of Assaf–Bergeron's flagged (P,ρ)-partition machinery, not a brand-new framework, but it is the right tool and the paper says so honestly.\n\nWhat is good: the main theorem is stated cleanly, the proof strategy is transparent, and the paper does not oversell. The partition of colorings by acyclic orientations and the use of linear extensions is standard but well executed. The recovery of the symmetric expansion is a nice payoff, and the backstable limit is handled carefully, following Lam–Lee–Shimozono. There is no circularity; the Assaf–Bergeron results are external and the symmetric expansion is used as a comparison, not an assumption. This is a solid, useful contribution for algebraic combinatorics.\n\nThe soft spots are real but not fatal. The biggest is Lemma 3.1, the equivalence between P_D-descents of π and ascents in ω_o ∘ π. The forward direction gets a detailed proof; the reverse direction, specifically the case π(i+1) ≻_{P_D} π(i), is dismissed with 'the argument is very similar... we omit the details.' That is the load-bearing step: it is what lets Lemma 3.2 replace F(L_π,ω_o,ρ) with a single slide polynomial indexed by rdes(L_π,ρ). Without the reverse direction written out, the reader cannot verify the main equality. I think the gap is fillable—the forward proof uses the Dyck graph property in an asymmetric way, and the reverse should be a mirrored argument—but 'should' is not 'is proved.' The authors should be asked to write it.\n\nTwo smaller issues. Lemma 3.5's proof is omitted entirely, though it is presented as a definition-unraveling, so that is minor. And the paper states that key-positivity fails for 6-vertex Dyck graphs but does not exhibit a counterexample; that is an easy fix and should be done. Also, the 'tail-strong' property of rdes(L_π,ρ) is asserted without proof, again minor.\n\nOverall: the central claim is very likely true, the gaps are of the 'details omitted' kind rather than errors, and the exposition is clear. This paper deserves a serious referee. I would send it out with a request to fill the Lemma 3.1 reverse case and the other omitted proofs, then accept.","headline":"The slide-positivity theorem is real and cleanly motivated, but the proof's main pivot, Lemma 3.1, has a hand-waved reverse direction that the authors need to fill in.","tokens_in":14413,"tokens_out":1995,"would_cite":true,"duration_ms":22760,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E05","05A05","05C15"],"pacs":[],"model":"deepseek-v4-flash","headline":"The chromatic nonsymmetric polynomial of every Dyck graph expands positively into fundamental slide polynomials.","keywords":["chromatic nonsymmetric polynomial","Dyck graphs","fundamental slide polynomials","slide-positivity","flagged (P,rho)-partitions","chromatic quasisymmetric function","backstable limit"],"falsifier":"Compute both sides of Theorem 3.3 symbolically for a small Dyck graph—for example, every partial Dyck path $D\\in P_{4,4}$, enumerating all 24 permutations and all proper colorings with $f(i)\\le \\rho_D(i)$—and compare the monomials of $X_D(x_4;t)$ with $\\sum_{\\pi\\in S_4} t^{\\operatorname{inv}_G(\\pi)}F_{\\operatorname{rdes}(L_\\pi,\\rho)}(x_4)$. Any mismatch, or any negative coefficient in the slide expansion of the left side, refutes the central claim.","tokens_in":13547,"feed_emoji":"🎨","tokens_out":11589,"duration_ms":111893,"temperature":0.7,"pith_summary":"The paper proves that the chromatic nonsymmetric polynomial $X_D(x_r;t)$ of any Dyck graph—the $t$-weighted generating function of proper colorings, with each vertex restricted to colors $1,\\dots,\\rho_D(i)$—has an expansion in fundamental slide polynomials whose coefficients lie in $\\mathbb{N}[t]$. This is the nonsymmetric polynomial analogue of the known expansion of chromatic quasisymmetric functions, and the authors show the classical symmetric expansion follows from theirs by a backstable limit. The proof groups proper colorings by the acyclic orientation they induce, realizes each orientation's colorings as flagged $(P,\\rho)$-partitions, and collapses each linear order's generating function to a single slide polynomial. The result makes slide-positivity a uniform structural property of Dyck graphs rather than a case-by-case check.","feed_headline":"Every Dyck graph color polynomial is slide-positive","feed_subtitle":"A positive slide-polynomial expansion is proven, and the known symmetric-function formula drops out as a limit.","key_machinery":"The load-bearing device is the reduced weak descent composition $\\operatorname{rdes}(L_\\pi,\\rho)$, built from a linear order on the vertices, the Dyck-graph restriction $\\rho$, and the tight restriction map $\\overline{\\rho}_{L_\\pi}$ obtained by replacing each color bound by the tightest one implied by the inequalities. Lemma 3.1 shows that descents of $\\pi$ relative to the incomparability poset $P_D$ coincide with ascents of the constructed labeling $\\omega_o$, and Lemma 3.2 uses this to turn each generating function $F(L_\\pi,\\omega_o,\\rho)$ into the single fundamental slide polynomial $F_{\\operatorname{rdes}(L_\\pi,\\rho)}(x_r)$. Theorem 3.3 then sums these contributions over all permutations, with the $t$-power recording $G$-inversions.","core_discovery":"The central result, Theorem 3.3, states that $$X_D(x_r;t)=\\sum_{\\pi\\in S_n} $t^{{\\operatorname{inv}}$_G(\\pi)}F_{\\operatorname{rdes}(L_\\pi,\\rho)}(x_r),$$ where $G=G_D$ is the Dyck graph of the partial Dyck path $D$, $\\operatorname{inv}_G(\\pi)$ counts edges of $G$ whose endpoints appear in decreasing order in $\\pi$, and $\\operatorname{rdes}(L_\\pi,\\rho)$ is the reduced weak descent composition of the linear order $L_\\pi$ with the restriction map $\\rho$ after tightening. Every summand is a fundamental slide polynomial with coefficient a power of $t$, so the expansion is positive and integral. In the backstable limit, the same expansion yields the known formula for the chromatic quasisymmetric function of $D$ in terms of fundamental quasisymmetric functions, indexed by the complement of the $P_D$-descent set of $\\pi$. The authors also record that a stronger positivity property in the key basis fails for some six-vertex Dyck graphs, which sets slide-positivity apart as the correct level of generality.","pith_inferences":["The same collapse mechanism could plausibly prove slide-positivity for other graph families whose incomparability posets satisfy a Dyck-like interval condition, provided the labeling algorithm of Lemma 3.1 can be adapted; testing unit interval orders outside the Dyck class would show where the boundary lies.","Because the expansion is indexed by permutations, it suggests a dynamic-programming recurrence along the Dyck path for the coefficients of $F_a(x_r)$; such a recurrence could be verified computationally for all partial Dyck paths with $n\\le 6$.","The backstable limit opens a connection to the theory of stable limits for nonsymmetric polynomials, and one could ask whether the backstable expansion is itself positive in some basis of formal power series beyond quasisymmetric functions.","The paper's six-vertex counterexamples to key-positivity make the slide basis a natural target for a refined conjecture: characterize which partial Dyck paths yield key-positive chromatic nonsymmetric polynomials, or identify a coarser basis than slides in which positivity always holds."],"forward_implications":["Every Dyck graph has a cancellation-free slide expansion of its chromatic nonsymmetric polynomial, so the polynomial's coefficients can be read directly from the Dyck path without enumerating colorings.","The known expansion of the chromatic quasisymmetric function of a Dyck graph in the fundamental quasisymmetric basis is a direct corollary, obtained by setting positive-indexed variables to zero in the backstable limit.","Because each permutation contributes exactly one slide polynomial (possibly zero), the expansion gives a finite combinatorial model for $X_D(x_r;t)$ indexed by $S_n$.","Slide-positivity is preserved under the backstable limit, so the same positivity transfers to the associated formal power series $\\overleftarrow{X}_D(x;t)$."],"supporting_citations":[{"why":"Defines flagged $(P,\\rho)$-partitions and supplies the reduction (Proposition 2.5, Corollary 3.15) that expresses each linear-order generating function as a single slide polynomial.","marker":"[3]"},{"why":"Defines fundamental slide polynomials and proves they form a basis for polynomials in $x_1,\\dots,x_r$.","marker":"[4]"},{"why":"Introduced the chromatic nonsymmetric polynomial $X_D(x_r;t)$ and the Dyck graph construction.","marker":"[10]"},{"why":"Defines the chromatic quasisymmetric function and proves the fundamental-basis expansion that the paper recovers as a limit.","marker":"[17]"},{"why":"Provides the backstable limit construction used to pass from slide polynomials to quasisymmetric functions.","marker":"[12]"}],"fun_headline_variants":["Slide-positivity proven for all Dyck graph colorings","New slide-positive expansion for chromatic nonsymmetric polynomials","Dyck graph chromatic polynomials are slide-positive, new proof","Slide expansion gives known symmetric formula via limit"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The expansion stands or falls on Lemma 3.1's equivalence between $P_D$-descents of $\\pi$ and ascents of the labeling $\\omega_o$, whose reverse direction is only sketched in the paper; if that equivalence fails in the omitted case, Lemma 3.2 and Theorem 3.3 lose their footing.","fun_headline_variants_meta":{"raw":{"variants":["Slide-positivity proven for all Dyck graph colorings","New slide-positive expansion for chromatic nonsymmetric polynomials","Dyck graph chromatic polynomials are slide-positive, new proof","Slide expansion gives known symmetric formula via limit"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000551,"raw_usage":{"total_tokens":2591,"prompt_tokens":871,"completion_tokens":1720,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":487,"completion_tokens_details":{"reasoning_tokens":1657}},"tokens_in":487,"tokens_out":1720,"duration_ms":12620,"temperature":1.0,"reasoning_tokens":1657,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:39:02.397418+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute both sides of Theorem 3.3 symbolically for a small Dyck graph—for example, every partial Dyck path $D\\in P_{4,4}$, enumerating all 24 permutations and all proper colorings with $f(i)\\le \\rho_D(i)$—and compare the monomials of $X_D(x_4;t)$ with $\\sum_{\\pi\\in S_4} t^{\\operatorname{inv}_G(\\pi)}F_{\\operatorname{rdes}(L_\\pi,\\rho)}(x_4)$. Any mismatch, or any negative coefficient in the slide expansion of the left side, refutes the central claim.","supporting_citations":[{"cited_title":"Flagged $(\\mathcal{P},\\rho)$-partitions","cited_arxiv_id":"1904.06630","evidence_quote":"Defines flagged $(P,\\rho)$-partitions and supplies the reduction (Proposition 2.5, Corollary 3.15) that expresses each linear-order generating function as a single slide polynomial."},{"cited_title":"Assaf and D","cited_arxiv_id":null,"evidence_quote":"Defines fundamental slide polynomials and proves they form a basis for polynomials in $x_1,\\dots,x_r$."},{"cited_title":"Macdonald polynomials and chromatic quasisymmetric functions","cited_arxiv_id":"1701.05622","evidence_quote":"Introduced the chromatic nonsymmetric polynomial $X_D(x_r;t)$ and the Dyck graph construction."},{"cited_title":"Shareshian and M","cited_arxiv_id":null,"evidence_quote":"Defines the chromatic quasisymmetric function and proves the fundamental-basis expansion that the paper recovers as a limit."},{"cited_title":"Lam, S.J","cited_arxiv_id":null,"evidence_quote":"Provides the backstable limit construction used to pass from slide polynomials to quasisymmetric functions."}],"review_version":1}