{"id":"9704bb0a-10d9-4234-9304-c020da3396b3","arxiv_id":"2412.18085","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"New rational symmetric functions are constructed from the 19-vertex model, with Cauchy identities, stable limits, and a symmetrization formula over 2-permutations.","lead":"The paper builds a new family of rational symmetric functions from the Izergin-Korepin 19-vertex model, where paths can take values 0, 1, or 2. It proves their symmetry, Cauchy identities, and an explicit formula for them as sums over a new class of objects called 2-permutations.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The twisted-column exchange relation (3.8.15) is load-bearing and is verified only by an undocumented computer check for N ≤ 4; until that check is supplied or re-derived, the symmetrization formula (3.8.36) is conditional.","rationale":"The reader's verdict is CONDITIONAL, with the weakest assumption identified as the exchange relation (3.8.15) for twisted column operators and its reduction to an undocumented N ≤ 4 computer check. My independent reading of Section 3.8 confirms that this is the correct load-bearing concern. The paper's main new result, Theorem 3.8.9, is proved by first establishing the twisted-column representation Theorem 3.8.4; that theorem's proof checks that g_S satisfies the characterizing properties of Propositions 3.7.2, 3.7.4, and 3.7.6, and the checks of the exchange properties are direct applications of (3.8.15). Hence any doubt about (3.8.15) propagates to the central formula. The proof of (3.8.15) is not merely 'routine verification omitted': it reduces the N-dependence to a structural assertion (3.8.17) that is stated without proof, and then to a finite computer check that is not included. There is no machine-checked proof, no supplementary code, and no external verification available in the text. This is a genuine gap rather than a stylistically compressed proof, because the asserted exchange relation is highly nontrivial for arbitrary N and was, by the authors' own account, found by computer experimentation. I do not see a second, equally load-bearing concern that would require changing the verdict. The paper contains substantial independent structure in the proof of the uniqueness theorem and the explicit formulas for the one-row functions, but those parts do not substitute for the missing verification of (3.8.15). Therefore the appropriate outcome is to maintain the CONDITIONAL verdict: the mathematical framework is plausible and the check appears feasible, but the central explicit formula should not be accepted as fully proven until the N ≤ 4 verification, and ideally the decomposition (3.8.17), is made available in a reproducible form.","tokens_in":81161,"tokens_out":3882,"duration_ms":42691,"concrete_test":"Run an exact symbolic computation, in Sage or Mathematica, of E^{(k,ℓ)}_D from (3.8.16)–(3.8.17) for N = 5 with generic symbolic x_1,...,x_5, y, z, and q, for all k, ℓ ∈ {0,1,2}; if any entry is nonzero, the reduction to N ≤ 4 is unsound and the central symmetrization formula collapses. If the N = 5 test vanishes identically, additionally run the N = 4 check with the authors' explicit Γ formulas and publish the script so that the asserted N ≤ 4 verification is reproducible; a successful independent reproduction would remove this particular obstruction to acceptance.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 3.8.9 (the central symmetrization formula) rests on Theorem 3.8.4 (the twisted-column representation), which in turn rests on Theorem 3.8.3, the exchange relation (3.8.15) for the operators Γ_k(z). The proof of Theorem 3.8.3 decomposes the error matrix E^{(k,ℓ)} into dot-diagram components and asserts the recursive decomposition (3.8.17), after which it claims that it suffices to check the cases 1 ≤ N ≤ 4 \"by computer.\" No computer code, no log, and no derivation of (3.8.17) are provided. The decomposition (3.8.17) is exactly the step that eliminates the dependence on N; if it is incorrect, the exchange relation could fail for N > 4 even if all cases N ≤ 4 pass. The rest of the uniqueness argument (Theorem 3.7.7) is a separate structure, but the verification in Propositions 3.8.5 and 3.8.6 that g_S satisfies the required exchange relations uses (3.8.15) directly. Thus the existence and correctness of the explicit sum over 2-permutations hang on this unverified computer check, making it the single most load-bearing concern.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces two families of rational multivariate functions, F_S and G_S, associated with the Izergin–Korepin 19-vertex model in the quadrant, in analogy with Borodin's functions for the stochastic six-vertex model. The authors prove symmetry of F_S and G_S in their primary alphabets and establish a Cauchy-type summation identity; they then pass to a stable family H_S with a fully factorized Cauchy kernel. The main novel result is a symmetrization formula for F_S: it is expressed as a sum over certain objects called 2-permutations, with summands given by products of one-row partition functions and explicit bivariate scattering factors. The proof of this formula is based on a family of twisted column operators Gamma_k(z), a uniqueness theorem for F_S obtained from exchange relations and polynomial interpolation, and an operator identity (3.8.18) that identifies F_S with a matrix element of a product of Gamma operators. Appendices illustrate the formula for N=2.","tokens_in":81464,"tokens_out":4054,"duration_ms":45025,"significance":"If fully established, the paper would introduce a genuinely new family of rational symmetric functions from a vertex model outside the U_q(A_1^(1)) series, with symmetry, Cauchy identities, stability, and an explicit symmetrization formula. The construction of totally spatially symmetric monodromy elements via Drinfeld-type twists in the Izergin–Korepin model would also be a notable technical contribution. The paper is careful and systematic: the symmetry and Cauchy results follow from standard Yang–Baxter arguments with explicit convergence conditions, the stable limit H_S is well motivated, and the conjectured symmetrization formula is tested in several nontrivial N=2 examples. However, the central symmetrization theorem is not yet fully proved: its proof rests on an exchange relation for twisted columns that is verified only by an undocumented computer check for N ≤ 4, and on a bijection argument in Section 3.8.4 that is presented as a sketch. The significance is therefore conditional on closing those gaps.","major_comments":[{"comment":"The exchange relation (3.8.15) for the twisted column operators Gamma_k(z) is load-bearing: it is used directly in Propositions 3.8.5 and 3.8.6 to verify that the matrix elements g_S satisfy the exchange relations and recursions that characterize F_S, and therefore to derive both the twisted-column representation (3.8.18) and the symmetrization formula (3.8.36). The proof of Theorem 3.8.3 reduces the problem to the recursive decomposition (3.8.17), asserts that this decomposition is 'not difficult to verify', and then states that the remaining cases 1 ≤ N ≤ 4 may be checked 'by computer'. No derivation of (3.8.17) and no code, log, or reproducible computation are supplied. Because (3.8.17) is exactly the step that eliminates the dependence on N, the finite check N ≤ 4 does not, by itself, establish the relation for arbitrary N. The authors should either provide a complete proof of (3.8.17) and of the N ≤ 4 verification, or supply machine-checkable code together with a clear description of the verification.","section":"§3.8.3, Theorem 3.8.4 and Propositions 3.8.5–3.8.7"},{"comment":"The proof of the operator identity (3.8.41) contains the step that converts the twisted-column representation into the explicit sum over 2-permutations. This step is described informally: the authors state that it 'is not difficult to check' that the proposed rule defines a bijection between M_2(N,S) and the surviving operator products, and that it 'is easily verified' that multiplying out the operators produces the product of one-row functions and the scattering factors. Since this matching argument is the core of the derivation of (3.8.36), it should be written out in detail, or at least formulated as a precise inductive statement with all cases of the local operators P_{σ(i,j)} and η_{σ(j)} treated explicitly. As written, the proof is too sketchy to be checked by a reader without extensive recomputation.","section":"§3.8.4"},{"comment":"The uniqueness theorem that underpins the whole approach is valid only if all the properties used in the induction are verified for the proposed solution g_S. The verification of property (5), the residue recursion (3.8.25), depends on the additional identity (3.8.34), whose proof is summarized in one paragraph. The computation of the residues of Γ_0(z)|0^N> and Γ_1(z)|0^N> at z = q^{-3}x_N is asserted but not shown in detail. Since this is a necessary part of the induction in Theorem 3.7.7, the authors should provide the missing computations so that a reader can verify the residue recursion without reconstructing the local operator algebra from scratch.","section":"§3.8.3, Proposition 3.8.7"}],"minor_comments":[{"comment":"In equation (3.7.5), the residue is taken with respect to z_1 at z_1 = q^{-3}x_N; this should be stated explicitly in the text, since the notation Res alone is slightly ambiguous in a multivariate rational function.","section":"§3.7.2"},{"comment":"The examples in Appendix A are helpful, but the one-row partition functions in (A.1.3), (A.2.3), and (A.3.3) are only presented pictorially. It would be more useful to write them explicitly using the formula for F_U(x;z) given in Theorem 3.8.9, so the reader can compare the expansion with the claimed scattering factors.","section":"Appendix A"},{"comment":"The remark that the operators Γ_k(z) were 'found by computer experimentation' is useful context, but the manuscript should distinguish clearly between experimental discovery and proof; as written, this sentence could be read as indicating that the subsequent verification is also computational rather than analytical.","section":"§3.8.3"},{"comment":"In the statement of Theorem 1.8.4, the two different displayed formulas for Δ_{U,V}(x,y;z) use the same shorthand 'U|1 1|/V|1 1|' with different relative-position diagrams. The reader would benefit from a small table that names each diagram and lists the corresponding formula, especially since the typeset diagrams are visually similar.","section":"§1.8"}],"recommendation":"major_revision","confidential_remarks":"I agree with the stress-test assessment that the missing verification of the exchange relation (3.8.15) is the single most serious gap. The paper's central claim is plausible and the surrounding theory is well developed, so I would not recommend rejection; however, the symmetrization formula is presented as a theorem, not as a conjecture, and the proof currently depends on an undocumented computer check and several asserted 'easy' verifications. This is fixable within the scope of the manuscript: the authors can provide a complete proof of (3.8.17), supply reproducible code for the N ≤ 4 cases, or state the theorem with the exchange relation as an explicit hypothesis. I would also ask the editor to ensure that the proof of the bijection in Section 3.8.4 is made rigorous before acceptance, as it is the final step that connects the operator identity to the explicit 2-permutation sum."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This paper is the first to build Borodin-style rational symmetric functions from a vertex model outside the U_q(A^(1)_n) family: the Izergin–Korepin 19-vertex model. That alone makes it worth knowing. The authors define F_S and G_S as partition functions, prove their symmetry and a Cauchy identity from Yang–Baxter, introduce a stable limit H_S with a factorized Cauchy kernel, and produce a symmetrization formula for F_S over their new \"2-permutations.\" The one-row functions and scattering factors are explicit, and Section 1.3 gives a genuine disambiguation argument explaining why these functions cannot be obtained by fusing Borodin's six-vertex functions. That is a real conceptual contribution, not just a technical extension.\n\nThe soft spot is exactly where the reader put it. Theorem 3.8.9, the symmetrization formula, rests on Theorem 3.8.3, the exchange relation for the twisted column operators. The proof of 3.8.3 decomposes the error matrix into dot-diagram components and claims the recursive decomposition (3.8.17), after which it says it suffices to check N ≤ 4 by computer. No code, no log, and no derivation of (3.8.17) are supplied. That decomposition is the step that eliminates the dependence on N; if it is wrong, the exchange relation could fail for N > 4 even if all small cases pass. The rest of the uniqueness argument is separate and looks sound, but the verification of g_S uses the exchange relation directly. So the main explicit formula is conditional on an undocumented computer verification.\n\nI don't think this is a fatal flaw. The paper is honest that the operators were found by computer experimentation, the N = 2 examples in the appendix check out, and the symmetry and Cauchy identities are standard Yang–Baxter consequences. But for a referee, I would want the authors to either supply the code, give a human proof of (3.8.17), or explain the verification in enough detail to be reproducible.\n\nWho is this for? People working in vertex-model symmetric functions and integrable probability will want to see it. It does not have the probabilistic payoff of Borodin's work—the authors note there is no parameter range making all weights positive—but the symmetric-function structure is novel. I would send it to a serious referee. If the computer check is confirmed or replaced, it becomes much stronger.\n\nRecommendation: engage with it, but require the verification to be supplied.","headline":"First Borodin-style symmetric functions from a non-U_q(A^(1)_n) vertex model, with real new structure but a load-bearing exchange relation whose proof currently leans on an undocumented computer check for N ≤ 4.","tokens_in":81948,"tokens_out":2318,"would_cite":true,"duration_ms":24833,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E05","82B23","17B37"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves rational symmetric functions $F_S$ and $G_S$ arise from the Izergin–Korepin 19-vertex model, with an explicit symmetrization formula for $F_S$ as a sum over 2-permutations with rational scattering factors.","keywords":["Izergin-Korepin 19-vertex model","rational symmetric functions","Cauchy identity","Yang-Baxter equation","symmetrization formula","2-permutations","twisted column operators","stable symmetric functions"],"falsifier":"Compute both sides of the symmetrization formula (3.8.36) symbolically for $N=5$ at generic parameters, comparing $F_S$ from its partition-function definition with the 2-permutation sum; any mismatch would falsify the formula. Equivalently, evaluate the matrix element $\\langle 2^5|\\Gamma_{S_1}(z_1)\\cdots|0^5\\rangle$ from the explicit $\\Gamma$ definitions and compare, which would also disprove the exchange relation (3.8.15) for arbitrary $N$.","tokens_in":80988,"feed_emoji":"🧮","tokens_out":13865,"duration_ms":117646,"temperature":0.7,"pith_summary":"Starting from the Izergin–Korepin nineteen-vertex model in the quadrant, this paper constructs two families of rational multivariate functions $F_S(x_1,\\ldots,x_N;z)$ and $G_S(y_1,\\ldots,y_M;z)$, indexed by 2-strings, and proves that they are symmetric in their primary alphabets and satisfy a Cauchy summation identity. In a suitable limit of the secondary alphabet $z$, $F_S$ degenerates to a stable family $H_S$ whose own Cauchy identity has a fully factorized kernel. The central new result is an explicit symmetrization formula for $F_S$: it is written as a sum over 2-permutation matrices, with each summand a product of one-row partition functions and pairwise rational scattering factors. The paper also obtains explicit, totally spatially symmetric formulas for the monodromy matrix elements of the model, expressed through twisted column operators. The paper presents these as the first rational symmetric functions built from a vertex model outside the standard $U_q(A_1^{(1)})$ series, with the symmetrization formula exhibiting the symmetry of $F_S$ directly.","feed_headline":"19-vertex partition functions reduce to 2-permutation sums","feed_subtitle":"Rational functions from the 19-vertex model gain Cauchy identities and an explicit symmetrization formula.","key_machinery":"The load-bearing object is the family of twisted column operators $\\Gamma_0(z),\\Gamma_1(z),\\Gamma_2(z)$ acting on the $N$-fold tensor product of the three-dimensional local space of the model. These operators are built from explicit diagonal matrices $d_i^u(z)$ and elementary matrices $e_i^u(z)$, $e_{ij}^{uv}(z)$ that multiply to reproduce the vertex weights of the Izergin–Korepin model. The paper proves that they satisfy the Yang–Baxter exchange relations (3.8.15) and are invariant under simultaneous permutation of tensor factors and spectral parameters $x_i$. That invariance yields the representation $F_S=\\langle 2^N|\\prod_i\\Gamma_{S_i}(z_i)|0^N\\rangle$, and expanding the product gives the 2-permutation sum through a bijection between 2-permutation matrices and surviving operator products. The exchange relation proof reduces verification to tensor products with at most four factors, stated to be checkable by computer.","core_discovery":"On its own terms, the paper establishes that the Izergin–Korepin nineteen-vertex model, in a sum-to-unity gauge, produces rational symmetric functions that mirror the six-vertex story. Theorem 3.8.9 asserts that for any 2-string $S$ of weight $2N$, $$F_S(x_1,\\ldots,x_N;z)=\\sum_{\\$\\sigma$\\in M_2(N,S)}\\prod_{1\\le i<j\\le N}\\Delta_{\\$\\sigma$(i),\\$\\sigma$(j)}(x_i,x_j;z)\\prod_{i=1}^N F_{\\$\\sigma$(i)}(x_i;z),$$ where $M_2(N,S)$ is the set of $N\\times\\infty$ 0-1-2 matrices with row sums 2 and column sums $S_i$, $\\sigma(i)$ is the $i$-th row, $F_{\\sigma(i)}(x_i;z)$ is an explicit one-row partition function, and $\\Delta_{U,V}(x,y;z)$ is an explicit rational scattering factor satisfying $\\Delta_{U,V}(x,y;z)=\\Delta_{V,U}(y,x;z)$. Because of that symmetry, the formula visibly exhibits the symmetry of $F_S$ in $(x_1,\\ldots,x_N)$. The paper further proves the Cauchy identity for $F_S,G_S$, the stable limit $H_S$, the factorized Cauchy identity for $H_S$, and the twisted-column representation $F_S=\\langle 2^N|\\prod_i\\Gamma_{S_i}(z_i)|0^N\\rangle$.","pith_inferences":["Our inference: setting $S=(2^N)$ in the symmetrization formula writes the Izergin–Korepin domain-wall partition function as a finite sum over 2-permutation matrices, opening a combinatorial route to its evaluation beyond the known root-of-unity cases; the paper does not pursue this evaluation.","Our inference: if the twisted column operators are genuine Drinfeld twists, as the paper suggests, the exchange relation would follow from general twist theory and the computer check would be replaced by a structural proof valid for all $N$.","Our inference: the factorized Cauchy identity for $H_S$ suggests an orthogonality theory and an integral transform analogous to the six-vertex case; the paper lists orthogonality as a future direction and proves no such result."],"forward_implications":["The partition functions $F_S$ and $G_S$ are symmetric functions in their primary alphabets for every 2-string $S$ of weight $2N$; this follows from the Yang–Baxter equation alone.","The Cauchy identity (3.4.3) holds: the weighted sum over all 2-strings of $F_S(x;z)G_S(y;q^{-3}z^{-1})$ equals the IK domain-wall partition function $F_{(2^N)}(x;z)$ times an explicit rational kernel.","The stable functions $H_S$ satisfy a Cauchy identity with fully factorized kernel, recovering $F_S$ when the string has maximal weight and simplifying under $x_N\\to\\infty$.","The symmetrization formula (3.8.36) gives a closed-form expansion of $F_S$ into one-row partition functions dressed by pairwise rational factors $\\Delta_{U,V}$, making the symmetry in $(x_1,\\ldots,x_N)$ manifest.","The monodromy matrix elements of the 19-vertex model admit explicit totally spatially symmetric formulas via the products of twisted column operators."],"supporting_citations":[{"why":"Supplies the six-vertex rational symmetric functions and their Cauchy and symmetrization identities, which this paper adapts to the Izergin–Korepin model.","marker":"[Bor17]"},{"why":"Extends the six-vertex rational functions to the higher-spin setting and provides the constructions and Cauchy identities used here as templates.","marker":"[BP16]"},{"why":"Provides the stochastic vertex model conventions and sum-to-unity gauge that the nineteen-vertex weights are chosen to mimic, plus the Drinfeld-twist perspective.","marker":"[BW22]"},{"why":"Introduces the Izergin–Korepin nineteen-vertex model and its R-matrix, whose partition functions define $F_S$ and $G_S$.","marker":"[IK81]"},{"why":"Places the IK R-matrix in the twisted affine family and supplies the Yang–Baxter framework underlying the proofs.","marker":"[Jim86]"},{"why":"Gives the known domain-wall partition function of the IK model at roots of unity, the object appearing on the right side of the Cauchy identity.","marker":"[Gar16]"},{"why":"Provides Korepin's uniqueness characterization of the six-vertex domain-wall function, whose analogue is used to prove uniqueness in Section 3.7.","marker":"[Kor82]"},{"why":"Gives Izergin's determinant formula for the six-vertex domain-wall function, the direct analogue of the explicit symmetric formulas sought in this paper.","marker":"[Ize87]"},{"why":"Motivates the twisted column operators as Drinfeld twists in the six-vertex model, the blueprint for the operators $\\Gamma_k(z)$.","marker":"[MdS00]"}],"fun_headline_variants":["19-vertex symmetries via 2-permutation sums","2-permutations: key to 19-vertex symmetry","New rational symmetric functions from 19-vertex","Cauchy identity and symmetrization for 19-vertex"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The decisive assumption is that the exchange relation (3.8.15) for the twisted column operators holds for every number of rows $N$, while the verification supplied in the paper covers only $1\\le N\\le 4$ by computer check.","fun_headline_variants_meta":{"raw":{"variants":["19-vertex symmetries via 2-permutation sums","2-permutations: key to 19-vertex symmetry","New rational symmetric functions from 19-vertex","Cauchy identity and symmetrization for 19-vertex"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000464,"raw_usage":{"total_tokens":2450,"prompt_tokens":1206,"completion_tokens":1244,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":822,"completion_tokens_details":{"reasoning_tokens":1176}},"tokens_in":822,"tokens_out":1244,"duration_ms":9174,"temperature":1.0,"reasoning_tokens":1176,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T05:02:45.790625+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute both sides of the symmetrization formula (3.8.36) symbolically for $N=5$ at generic parameters, comparing $F_S$ from its partition-function definition with the 2-permutation sum; any mismatch would falsify the formula. Equivalently, evaluate the matrix element $\\langle 2^5|\\Gamma_{S_1}(z_1)\\cdots|0^5\\rangle$ from the explicit $\\Gamma$ definitions and compare, which would also disprove the exchange relation (3.8.15) for arbitrary $N$.","supporting_citations":[],"review_version":1}