{"id":"ae2ddc4d-4dd7-44a5-a7c3-a941edc7e4eb","arxiv_id":"2412.00116","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Two weight-preserving, branching-compatible bijections between column strict fillings and partition overlaid patterns for q-Whittaker polynomials, yielding a CSF character formula for the basic representation of affine sl_n.","lead":"This paper builds two explicit bijections between column-strict fillings (CSFs) and partition overlaid patterns (POPs) that both compute the same q-Whittaker polynomial, preserving weights and commuting with projection and branching maps. It thereby gives a CSF-native basis of local Weyl modules and a new column-strict-filling formula for the character of the level-1 vacuum module of affine sl_n.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 9's commutativity with the external S-map is asserted without proof and without defining S; the direct-limit character formula rests on it. Until S is written out and the diagram checked, the L(Λ0) result is unverified.","rationale":"The reader's conditional verdict is supported. The main bijection theorem is carefully argued, and the proof of Proposition 1 supplies enough of the braid relations for the restricted cases actually used. However, the direct-limit results are load-bearing for the paper's claim that the CSF model carries the full POP/CL direct-limit structure, and they depend on Proposition 9, whose proof is a single sentence referring to an external map S that is not defined in the paper. This is precisely the kind of omitted verification that should be supplied before the L(Λ0) character formula is accepted. The concrete test above would settle whether the asserted commutativity holds in small instances and would force the missing definition of S into the open. I would therefore keep the reader's CONDITIONAL verdict unchanged: the paper should be accepted only after Proposition 9 is either proved or replaced by an explicit, checkable definition of S and a verification of the diagram.","tokens_in":29212,"tokens_out":18444,"duration_ms":177745,"concrete_test":"Write out the definition of S : POP(λ+kθ) → POP(λ+(k+1)θ) from [RRV18, §6]. Then, for n = 3 (or n = 4) and λ = ∅, enumerate every F ∈ CSF(kθ) for k = 0, 1, 2, compute ψinv(F) and ψinv(s(F)) using the explicit constructions in Sections 8–9, and compare ψinv(s(F)) with S(ψinv(F)) elementwise. Any mismatch falsifies Proposition 9. If the small cases agree, repeat the check symbolically for general n and k, or supply the missing proof; the published article should include either the definition of S or an independent verification of the diagram.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's advertised direct-limit claim depends on Proposition 9 (Section 10.4), which asserts that the explicit CSF insertion s (adding a left column 2,3,...,n and a right column 1) is conjugated by the inv bijection to the map S in [RRV18]. This is the least secure point. S is not defined in the present paper: the text explicitly refers the reader to [RRV18, §6], and the only justification given is that the diagram is 'a simple consequence of the definitions.' That is not a proof, particularly because ψinv is a nontrivial bijection built in Sections 8–9. If Proposition 9 fails, the identification of C = ⊔ C_k(λ) with representatives of lim POP(λ+kθ) is broken, and the new CSF character formula for L(Λ0) in Proposition 10 and Corollary 7 does not follow. The core bijection theorem, Theorem 2, is proved in detail and I found no specific error in its checked steps; the gap is that the claim that CSFs carry the full direct-limit structure goes beyond what is actually established. The deferred braid relations are less serious because Proposition 1 only needs the two-length special case, which is proved.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies monomial expansions of q-Whittaker polynomials in the column-strict-filling (CSF) model and the partition-overlaid-pattern (POP) model. Its central result, Theorem 2, constructs two bijections psi_inv and psi_quinv from CSF(lambda) to POP(lambda) that preserve x-weight and the respective q-statistic, commute with the projection maps rsort/pr and the branching maps dsplice/br, and are related by box complementation. The proof introduces splice operations on columns, a delete-and-splice branching map, cellwise zcount statistics, and a refinv statistic. The paper also claims CSF-native Chari-Loktev bases (Proposition 2), a direct-limit construction for CSFs, and a new character formula for the basic representation L(Lambda_0) of the affine Lie algebra (Propositions 9-10, Corollary 7), and it closes with a lattice-path interpretation of the bijections.","tokens_in":29429,"tokens_out":24181,"duration_ms":212523,"significance":"If the main claims hold, this is a useful contribution: it gives an explicit, structure-preserving dictionary between two standard combinatorial models for q-Whittaker polynomials, resolves part of the Ayyer-Mandelshtam-Martin question on inv/quinv bijections, and provides a CSF-native perspective on Chari-Loktev bases and on direct limits towards the affine basic representation. The proof of Theorem 2 is detailed and supported by explicit constructions: Proposition 5 gives the clean complement relation between zcount and zcount, Lemma 5 is a five-case verification of splice-invariance, and Section 9.2 contains an explicit inverse algorithm. The advertised direct-limit character formula, however, rests on an unproved commutativity statement with an external map S, and Proposition 2 contains false statements as written. These issues are localized but must be repaired before the paper's full claims are acceptable.","major_comments":[{"comment":"Proposition 9 is load-bearing for the direct-limit identification and for the new character formula of Proposition 10 and Corollary 7, but it is not proved. The map S is not defined in the paper; the text refers the reader to [RRV18, §6], and the commutativity of the diagram with s and psi_inv is dismissed as 'a simple consequence of the definitions'. Since psi_inv is a nontrivial bijection constructed in Sections 8–9, this assertion cannot be checked without spelling out S and verifying the diagram. Please reproduce the definition of S (or make the relevant statement from [RRV18] self-contained) and give a proof of the commutativity. Until then, the direct-limit character formula should be regarded as unverified.","section":"§10.4, Proposition 9"},{"comment":"As written, Eqs. (47)–(48) are not a correct description of the Chari–Loktev monomials CL(P_v). The product ranges over all cells c in dg(lambda), but for a cell with F(c)=i(c) the symbol E_{F(c),i(c)} is not an element of n^-[t] (e.g., row-1 cells containing 1 would give E_{1,1}); only cells in cells(i,j,F) with 1 ≤ i ≤ j < n occur in CL(P_v). Moreover, zero zcount values are not removable: in CL(P), a part of size 0 contributes a factor E_{j+1,i} ⊗ 1. Accordingly, in the displayed example for F = 1 2 1 2 / 3 4, the cell (2,1) with entry 3 has zcount = 0 but contributes E_{3,2} ⊗ 1 to CL(P_quinv), and that factor is missing from the displayed b_quinv(F). The formula needs a restricted product over the cells of cells(i,j,F), 1 ≤ i ≤ j < n, with zero-exponent factors retained.","section":"§9.4, Proposition 2(3), Eqs. (47)–(48)"},{"comment":"Proposition 2(2) is false as stated. Take n = 3, lambda = (3,2), F1 = (1 2 1 / 2 3) and F2 = (1 1 2 / 2 3). Both are column-strict and rsort(F1) = rsort(F2) with T = (1 1 2 / 2 3). For c = (1,2), F1(c) = 2 and the sum (zcount(c,F1) + zcount(c,F1)) equals 1 (the unique contributing triple is a refinv-triple with x = (1,3), y outside the diagram), whereas F2(c) = 1 makes both summands equal to 0. Hence the claimed equality fails for this pair. The statement should be corrected, for instance by restricting to cells with a fixed value F(c) = j+1, or removed if it is not needed.","section":"§6, Proposition 2(2)"}],"minor_comments":[{"comment":"The reference [RRV18] is typeset inconsistently as 'RR V18' or 'RRV18' in several places; this should be normalized.","section":"Throughout"},{"comment":"The line 'X y∈Des(y) coarm(y↑)' contains a typo; it should be a sum over y ∈ Des(F).","section":"§8.1, proof of Proposition 4"},{"comment":"The displayed zcount values for F = 1 2 1 2 / 3 4 appear inconsistent with Definition 6: for the cell (1,3) of value 2, the triple with x = (1,1) and y = (2,1) is a quinv-triple (1 < 2 < 3), so its zcount is at least 1, while the displayed row has a 0 there.","section":"§9.4, Example 3"},{"comment":"In the definition of s(F), the text says 'for F in CSF(lambda + ktheta)' but then writes s(F) in CSF(lambda + (k+1)theta); this is clear from context, but the notation for the map's domain and codomain should be stated explicitly.","section":"§10.4"}],"recommendation":"major_revision","confidential_remarks":"The core bijection theorem is supported by a detailed proof and I found no specific error in its checked steps. The two problems in Proposition 2 are concrete and localized, and the direct-limit gap in Proposition 9 needs a genuine proof rather than a citation. The reliance on [RRV18] is acceptable since that construction is published, but the authors should make the dependence explicit and self-contained. I would not reject on the current evidence; major revision is appropriate."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The core of this paper is Theorem 2, the two bijections between column strict fillings and partition overlaid patterns, and it is mostly solid. The construction of ψinv and ψquinv via cellwise zcounts is genuinely new, the five-case analysis in Lemma 5 is real work, and the inverse algorithm in Section 9.2 gives an explicit way to check the bijections. The splice/dsplice branching formalism is also new, and Proposition 1 is proved carefully enough for the restricted case the paper needs. I found no specific error in the checked steps of the main theorem, and the lattice path readout in Section 11 is a nice visual, even if the verifications there are left to the reader.\n\nThe soft spot is exactly where the stress-test note points. Proposition 9 asserts that the CSF insertion map s is conjugated by ψinv to the map S from [RRV18], and the proof is one sentence: “a simple consequence of the definitions.” But S is not defined in this paper, and ψinv is a nontrivial bijection built over two sections. The direct-limit identification and the new character formula in Proposition 10 and Corollary 7 rest entirely on that diagram. As written, the L(Λ0) result is unverified — not necessarily wrong, but not established here. The authors also defer the full braid relations for the splice operators, but that is less serious: Corollary 2 proves exactly the two-length case needed for dsplice well-definedness.\n\nTwo smaller things. The dependence on [RRV18] is real but legitimate: it is a published construction, and the overlap is with one coauthor, not hidden. The paper is honest about what it defers — Proposition 9 is flagged only by its brevity, but the braid relations are explicitly stated as future work. The citation pattern looks fine.\n\nBottom line: this deserves a serious referee. The main bijection theorem should hold up, and the direct-limit application is worth checking. The referee needs to write out S, prove Proposition 9, or at least give a convincing reduction to [RRV18]. If that step closes, this is a strong paper. If it does not, the CSF character formula is only a conjecture and should be labeled as such.","headline":"Solid bijection paper with a load-bearing Proposition 9 that is asserted, not proved; the CSF character formula for L(Λ0) is conditional until that diagram is checked.","tokens_in":30022,"tokens_out":1184,"would_cite":true,"duration_ms":13591,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E10","05E05"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper constructs two bijections between column strict fillings and partition overlaid patterns, making the CSF model carry the projection, branching, and direct-limit structure of local Weyl modules for the affine Lie algebra…","keywords":["q-Whittaker polynomials","column strict fillings","partition overlaid patterns","inv statistic","quinv statistic","local Weyl modules","basic representation","coloured lattice paths"],"falsifier":"For $n=3$ and $\\lambda=\\emptyset$, list all CSFs in $C_k$ for $k=0,1,2$ and compute the sum $\\sum_{F\\in C_k}x^F q^{k^2-\\mathrm{inv}(F)}$; compare each monomial coefficient with the known $\\theta$-function expansion of $\\chi_{\\Lambda_0}$. A single mismatch, or a failure of the fiber identity $\\sum_{\\mathrm{rsort}(F)=T}q^{\\mathrm{inv}(F)}=\\mathrm{wt}_q(T)$ on a small shape such as $(2,1)$, would overturn the paper's main structural claims.","tokens_in":28979,"feed_emoji":"🧩","tokens_out":13722,"duration_ms":112587,"temperature":0.7,"pith_summary":"The paper aims to show that column strict fillings, the natural indexing set for the inv and quinv expansions of the q-Whittaker polynomial, can be equipped with projection, branching, and direct-limit structures that exactly mirror those of partition overlaid patterns, the model tied to local Weyl modules of the affine Lie algebra $\\widehat{\\mathfrak{sl}}_n$. It constructs two explicit bijections $\\psi_{\\mathrm{inv}}$ and $\\psi_{\\mathrm{quinv}}$ between the two models that preserve monomials and $q$-weights, commute with the natural projection and branching maps, and differ by box complementation. If these bijections are correct, the finite CSF model carries the same module-theoretic information as the POP model, yielding CSF-native monomial bases of local Weyl modules and a new column-strict-filling formula for the character of the level-one vacuum module. A sympathetic reader would care because the paper turns a finite, row-sortable tableaux model into a vehicle for infinite-dimensional representation theory, and gives a concrete computable bridge between two previously separate combinatorial worlds.","feed_headline":"Two bijections make fillings and pattern overlays interchangeable","feed_subtitle":"Column-strict fillings now inherit projection, branching, and direct limits, yielding a new affine character formula.","key_machinery":"The load-bearing object is a pair of cellwise statistics on a column strict filling $F$: $\\mathrm{zcount}(c,F)$, the number of quinv-triples whose third cell is $c$, and $\\overline{\\mathrm{zcount}}(c,F)$, the number of reflected inv-triples whose third cell is $c$. For $T=\\mathrm{rsort}(F)$, both counts are bounded by $T^i_j-T^{i+1}_{j+1}$, and the two counts add to exactly this SE-difference, so reading either set of counts row by row yields the partition overlays that define a POP. The inverse bijections place entries one row at a time into labelled candidate cells. The branching structure is carried by the splice operation (a suffix swap between adjacent column tuples), iterated in the delete-and-splice algorithm, and the direct limit by the map that adds a prescribed pair of columns at each step.","core_discovery":"The central claim is Theorem 2: for every partition $\\lambda$ with at most $n$ nonzero parts, there exist two bijections $\\psi_{\\mathrm{inv}},\\psi_{\\mathrm{quinv}}:\\mathrm{CSF}(\\lambda)\\to\\mathrm{POP}(\\lambda)$ with the following properties: the monomial of $F$ equals the monomial of the GT pattern in its image, the statistic $\\mathrm{inv}(F)$ (respectively $\\mathrm{quinv}(F)$) equals the total size of the overlaid partitions, the projection $\\mathrm{rsort}$ commutes with the POP projection, the branching map $\\mathrm{dsplice}$ commutes with the POP branching map, and $\\psi_{\\mathrm{quinv}} = \\mathrm{boxcomp}\\circ\\psi_{\\mathrm{inv}}$. The proof machinery is cellwise: counting quinv-triples ending at a cell produces the quinv overlay, counting reflected inv-triples produces the complementary inv overlay, and the two counts always sum to the same SE-difference of the projected GT pattern. From this the paper obtains that the standard monomial basis of a local Weyl module can be indexed natively by CSFs with grades $\\mathrm{inv}$ or $\\mathrm{quinv}$, and that the direct limit of the CSF chain (append a column $2,3,\\dots,n$ on the left and a column $1$ on the right) computes the character of the basic representation.","pith_inferences":["If Proposition 9 is supplied with a fully written proof, the CSF model likely becomes the most explicit route to affine Demazure characters, since its direct-limit map $s$ is described locally while the POP map $S$ is only cited.","The same cellwise counts may adapt to modified Hall-Littlewood polynomials and their quasisymmetric generalizations, yielding branching-friendly bases in those settings as well.","The intersection/non-intersection encoding suggests a purely path-theoretic proof of the fermionic formula that never mentions POPs; this is testable by checking whether the tile-by-tile counts satisfy the braid relations directly.","A computational check of the equivalences on small shapes would also test whether $\\psi_{\\mathrm{inv}}$ and $\\psi_{\\mathrm{quinv}}$ can be built recursively from elementary splices, which would give a simpler presentation of the bijections."],"forward_implications":["For each GT pattern $T$, the fibers of $\\mathrm{rsort}$ have $q$-generating function $\\mathrm{wt}_q(T)$, and $\\mathrm{inv}+\\mathrm{quinv}$ is constant on each fiber.","The involution $\\Omega=\\psi_{\\mathrm{inv}}^{-1}\\circ\\psi_{\\mathrm{quinv}}$ swaps $\\mathrm{inv}$ and $\\mathrm{quinv}$ while preserving the row-sorted tableau, giving an explicit bijection of the kind asked about in the quinv literature.","The sets $\\{b_v(F)w_\\lambda:F\\in\\mathrm{CSF}(\\lambda)\\}$, for $v=\\mathrm{inv},\\mathrm{quinv}$, are homogeneous monomial bases of the local Weyl module, with $q$-grade $v(F)$ and weight $x^F$.","The direct-limit chain yields $\\chi_{\\Lambda_0}=\\sum_{k\\ge0}\\sum_{F\\in C_k(\\lambda)}x^F q^{\\|\\lambda+k\\theta\\|^2/2-\\mathrm{inv}(F)}$, and for $\\lambda=\\emptyset$ the simpler form with $q^{k^2-\\mathrm{inv}(F)}$.","In the coloured lattice path model, solid circles (intersections) read off the quinv overlay while open circles (non-intersections) read off the inv overlay, giving a simultaneous visual proof of both weight identities."],"supporting_citations":[{"why":"Supplies the inv-statistic expansion of the q-Whittaker polynomial and the inv-triple counting adapted in the proof of $\\psi_{\\mathrm{inv}}$.","marker":"[HHL05]"},{"why":"Introduces the quinv statistic and its triple formulation; the paper's $\\psi_{\\mathrm{quinv}}$ matches its expansion and partially answers its bijection question.","marker":"[AMM23]"},{"why":"Defines the local Weyl modules and the PBW-type monomial basis whose indexing set is repurposed into CSF-native bases.","marker":"[CL06]"},{"why":"Supplies the partition overlaid pattern model, its projection, branching, box-complementation and direct-limit structures, including the map $S$ that Proposition 9 must commute with.","marker":"[RRV18]"},{"why":"Establishes the Demazure-module chain whose direct limit is the basic representation, the target of the new CSF character formula.","marker":"[FL07]"},{"why":"Gives the fermionic q-binomial formula and the box-complement/area identities that underlie the fiber weights and complement relation.","marker":"[Mac95]"},{"why":"Records the reflected inv statistic used as the bridge between inv- and quinv-triple counts in the proof of $\\psi_{\\mathrm{inv}}$.","marker":"[Kir00]"}],"fun_headline_variants":["Two bijections link fillings and patterns, unlocking affine characters","Fillings and overlays biject, preserving projections and limits","New bijections make CSF and POP models fully equivalent","Column-strict fillings inherit affine branching and limits","Bijections unify two models, yielding a new character formula"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The direct-limit character formula rests on Proposition 9, which asserts that the new CSF injection $s$ commutes with the previously defined POP injection $S$; $S$ is only cited from earlier work, not defined here, and the commutativity is stated as a 'simple consequence of the definitions' without proof, so if that diagram fails the limit formula does not follow.","fun_headline_variants_meta":{"raw":{"variants":["Two bijections link fillings and patterns, unlocking affine characters","Fillings and overlays biject, preserving projections and limits","New bijections make CSF and POP models fully equivalent","Column-strict fillings inherit affine branching and limits","Bijections unify two models, yielding a new character formula"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000453,"raw_usage":{"total_tokens":2302,"prompt_tokens":992,"completion_tokens":1310,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":608,"completion_tokens_details":{"reasoning_tokens":1225}},"tokens_in":608,"tokens_out":1310,"duration_ms":8792,"temperature":1.0,"reasoning_tokens":1225,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T10:43:48.382656+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For $n=3$ and $\\lambda=\\emptyset$, list all CSFs in $C_k$ for $k=0,1,2$ and compute the sum $\\sum_{F\\in C_k}x^F q^{k^2-\\mathrm{inv}(F)}$; compare each monomial coefficient with the known $\\theta$-function expansion of $\\chi_{\\Lambda_0}$. A single mismatch, or a failure of the fiber identity $\\sum_{\\mathrm{rsort}(F)=T}q^{\\mathrm{inv}(F)}=\\mathrm{wt}_q(T)$ on a small shape such as $(2,1)$, would overturn the paper's main structural claims.","supporting_citations":[],"review_version":1}