{"id":"36f7f917-3e36-4bf2-a8cf-59ffdb056efc","arxiv_id":"2505.24491","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper defines generalized Vassiliev relations for functions on permutations, proves the gl- and so- weight systems satisfy them, and studies the resulting Hopf algebras and KP-hierarchy connection.","lead":"This paper extends the theory of weight systems from chord diagrams to arbitrary permutations by proposing generalized Vassiliev relations. It shows the gl- and so- Lie algebra weight systems satisfy these relations and connects their averages to the KP integrable hierarchy.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Central Theorems 4.1/4.11 rest on unproven confluence of the wso recurrence (Def. 4.3) and one-sentence proofs; the Zaitsev appendix proving Theorem 4.7 is absent, leaving the core claims insufficiently verifiable.","rationale":"Good-faith reading: the paper's project is to give permutations a role fully analogous to chord diagrams (quotient by generalized 4-term relations) and to show that the universal gl- and so-weight systems descend to that quotient. For the central claim to hold one needs (i) the relations make sense on cyclic classes (Lemma 3.1 — sketched but plausible), (ii) wgl and wso are well-defined functions on permutations, and (iii) Theorems 4.1 and 4.11 are correct. I judge (ii) secure for wgl: the universal object is cited to [9,23] and matches the direct matrix-unit formula in §4.1. For wso, however, Definition 4.3 contains the paper's own confluence assertion, with the text conceding that the reduction 'depends on the global structure of the original graph'; that makes wso's well-definedness the weakest internal load-bearing premise behind the central claim. I judge (iii) partially established: Theorem 4.1's pairing argument is credible and two explicit symbolic checks are given, but the exceptional case of Fig. 9 and the S_{m−1} coincidence identity are not written out, and Theorem 4.11 is effectively unproved in the text. Separately, the omitted Zaitsev appendix behind Theorems 4.7 and 4.9 is an explicit missing proof, flagged in the text itself ('see Appendix'), and it underpins the advertised KP tau-function corollary. The paper has real independent support elsewhere: complete proofs of Theorems 4.2, 4.4, 4.13, and 5.6, a worked averaging count (Theorem 4.6), and concrete dimension tables (though the latter are asserted without derivations). No inconsistency is visible, so REJECT would be wrong; but acceptance needs the sketched steps filled in. The reader's CONDITIONAL verdict is appropriate; my read sharpens the condition (confluence of Definition 4.3, a real proof of Theorem 4.11, and the appendix) without moving the verdict.","tokens_in":24661,"tokens_out":18533,"duration_ms":206037,"concrete_test":"Independently implement wgl (Fig. 7 recurrence with C_m base values) and wso (Definition 4.3) and run, for all permutations in S_6 and S_7 with at least two cycles: (a) compute wso(α) using several different reduction orders (different choices of k, k+1; different sign-flip sequences for the extended-graph terms) and check agreement; (b) for every hyperedge and free leg, evaluate the alternating sums of Definitions 3.1 and 3.2 and check that they vanish. Any disagreement between reduction orders, or any nonzero alternating sum, refutes Definition 4.3 or Theorem 4.11. As a secondary check, recompute the averages A_m for m ≤ 8 from wgl and verify the claimed Schur-substitution form S_m − (1/24)(N−1)(N+m−1)^2 S_{m−2} + ... , which would confirm the missing appendix's main assertion in low degrees.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim — that the universal gl- and so-weight systems on permutations satisfy the new generalized Vassiliev relations (Theorems 4.1, 4.11) — is established only by recurrence-based sketches, and the load-bearing steps are asserted rather than demonstrated.\n\n(1) Definition 4.3 defines wso axiomatically; its Recurrence Rule (Fig. 13) is a five-term relation involving extended permutation graphs, and the text itself notes that the last two terms' conversion to ordinary permutation graphs 'depends on the global structure of the original graph.' Confluence — independence of the choice of consecutive pair k, k+1 and of the extended-graph reduction order — is asserted via the sign-symmetry but never proven. Without confluence, wso is not established as a function on permutations, and Theorem 4.11 has no well-defined object. This gap is internal to the paper; for wgl the same issue is mitigated because the recurrence is cited to [9,23] and anchored by the direct gl(N) formula in §4.1.\n\n(2) Theorem 4.11's proof is a single sentence ('similar to Theorem 4.1') although the wso recurrence has five terms and mixes ordinary and extended graphs. Theorem 4.1's own proof omits the exceptional case σ(k+1)=k (Fig. 9) and asserts, without showing, that the two gluings of the cycles into S_{m−1} 'coincide' for paired legs; only Examples 4.1–4.2 (the smallest wgl relations) are symbolically verified.\n\n(3) Theorems 4.7 and 4.9 are stated as proved in an appendix by M. Zaitsev that is absent from the submission, and the introduction says the proof is 'to appear' in a separate paper. Corollary 4.8 (KP tau-function) is therefore unverifiable in the supplied text.\n\nNo explicit error is visible; the problem is that a referee cannot certify Theorems 4.1, 4.11, and 4.7 from the submission as it stands.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces generalized Vassiliev relations for functions on permutations, viewed as hyper chord diagrams modulo cyclic shifts, and claims that the universal gl- and so-weight systems satisfy these relations (Theorems 4.1 and 4.11). It develops hypermap topology for permutations, derives the standard-representation face-counting formula for gl (Theorem 4.2), proves a formula relating wgl on a permutation and its inverse under the Schur substitution (Theorem 4.4), and states an averaging theorem for wgl whose leading terms give KP tau-functions (Theorems 4.6–4.9 and Corollary 4.8). The second half of the paper constructs Hopf and rotational Hopf algebras on permutations, studies their primitive subspaces and dimensions, and proves a theorem about the primitive projection of chord diagrams under the legwise comultiplication (Theorem 5.6).","tokens_in":25025,"tokens_out":2859,"duration_ms":39605,"significance":"If the central theorems hold, the paper provides a natural extension of the theory of weight systems from chord diagrams to arbitrary permutations, along with a new combinatorial source of KP tau-functions and a rich family of Hopf algebras on permutations. The gl-weight system on permutations is already used in the literature for efficient computation, and the generalized Vassiliev relations give it a structural interpretation. The paper also contains genuinely useful explicit computations (Examples 4.1 and 4.2, dimension tables, Theorem 4.4) and a complete proof of Theorem 5.6. However, the load-bearing proofs of Theorems 4.1, 4.7, 4.9, and 4.11 are either sketched or deferred to an appendix that is not part of the submitted manuscript, so the current version is not fully verifiable.","major_comments":[{"comment":"The universal so-weight system is defined by axioms plus a five-term recurrence rule, but the paper does not prove that this recurrence is confluent. The text itself states that the conversion of the last two extended permutation graphs in Fig. 13 into ordinary permutation graphs 'depends on the global structure of the original graph,' and the subsequent assertion that the sign symmetry removes the ambiguity is not demonstrated. Since Theorem 4.11 asserts that wso satisfies the generalized Vassiliev relations, the object wso must first be established as a well-defined function on permutations; without a confluence proof, the theorem has no precisely defined subject.","section":"§4.6, Definition 4.3 and Fig. 13"},{"comment":"The proof of Theorem 4.1 is a sketch rather than a complete argument. The two-hyper-arc case relies on an unproved assertion that the two gluings of cycles 'coincide' for paired legs, the exceptional case σ(k+1)=k shown in Fig. 9 is not treated in the proof, and the one-hyper-arc case is dismissed with 'the proof is similar.' Examples 4.1 and 4.2 verify only the smallest instances of the relations. Because Theorem 4.1 is the central structural claim of the paper, a complete proof or a precise reference to one is needed before the result can be considered established.","section":"§4.1, Theorem 4.1"},{"comment":"The averaging theorem and the explicit generating function for the coefficients ak are stated as proved in an appendix by M. Zaitsev that is not included in the manuscript. These theorems are load-bearing for Corollary 4.8, which asserts that the generating function of averages is a one-parameter family of KP tau-functions. As submitted, the proof is unavailable to the reader, so this part of the paper cannot be verified. The authors should include the appendix or supply a self-contained proof in the main text.","section":"§4.5, Theorems 4.7 and 4.9"},{"comment":"The proof of Theorem 4.11 consists of the single sentence 'The proof of the theorem is similar to that of Theorem 4.1.' This is insufficient because the wso recurrence has five terms, mixes ordinary and extended permutation graphs, and involves the additional sign/cycle-orientation symmetry. Even if the confluence issue in Definition 4.3 is resolved, the verification of the generalized Vassiliev relations for this more complicated recurrence requires a separate argument or at least a detailed indication of which terms pair up and cancel.","section":"§4.6, Theorem 4.11"}],"minor_comments":[{"comment":"The word 'realted' in the abstract should be 'related'.","section":"Abstract"},{"comment":"The section heading 'A veraging gl-weight system' contains a typo; it should read 'Averaging the gl-weight system.'","section":"§4.5 heading"},{"comment":"In the sentence 'Denote by π′ : A′ → P(A′) the projection to the subspace of primitives associated to the comultiplication π′,' the projection and the comultiplication are both denoted π′; the comultiplication should be µ′.","section":"§5.3.3"},{"comment":"The term 'connected sum (concatenation)' is used without definition for hyper arc diagrams; since the multiplicative property is one of the defining axioms of wgl, this terminology should be made precise.","section":"§4.1, first bullet"},{"comment":"The definition of rotational equivalence for arbitrary permutations refers to a recursively constructed tuple of connected permutations, but the recursion is stated informally; a more formal definition would improve readability, especially since the subsequent dimension computations depend on it.","section":"§5.3, rotational equivalence"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is likely correct in its main ideas, and the problems identified are fixable in principle, but the current submission does not contain enough detail to verify the central theorems. The missing Zaitsev appendix is particularly awkward because Theorems 4.7 and 4.9 are explicitly advertised as main results. I recommend major revision with the expectation that the authors either include the appendix, provide complete proofs of Theorems 4.1, 4.11, and the confluence of the wso recurrence, or clearly mark those parts as conjectural."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear Colleague,\n\nThe real contribution here is the generalized Vassiliev relations on permutations and the fact that the universal gl- and so-weight systems are models for them. That is a natural framework and it is new: earlier work extended weight systems to permutations for computational convenience, but did not define the relations themselves. The inverse-permutation formula (Thm 4.4) and the averaging formula (Thm 4.7) are concrete, checkable statements, and the KP tau-function corollary is a nice payoff. The rotational Hopf algebras in Section 5 are a sensible companion construction, and the authors are honest that they lack a geometric interpretation for the generalized relations.\n\nNow the soft spots, in proportion.\n\nThe proof of Theorem 4.1 is a sketch. It relies on the recurrence in Fig. 7, but the exceptional case sigma(k+1)=k (Fig. 9) is not handled, and the step where two gluings 'coincide' is asserted rather than shown. The two worked examples are persuasive but cover only the smallest relations.\n\nMore seriously, Theorem 4.11 gets a one-sentence proof ('similar to Theorem 4.1'), while its object wso is defined by axioms with a five-term recurrence in Fig. 13. The text itself notes that the last two terms' conversion to ordinary permutation graphs depends on global structure. Confluence of this recurrence is asserted via the sign symmetry but never proved. Without confluence, wso is not rigorously a function on permutations, and Theorem 4.11 has no well-defined object. This is the kind of gap a referee should send back for a real proof.\n\nThe other load-bearing issue is the missing appendix by Zaitsev. Theorems 4.7 and 4.9 are stated as proved there, but the appendix is not in the submission; the introduction says the proof is 'to appear' in a separate paper. That makes Corollary 4.8 and the central averaging claim unverifiable from the supplied text.\n\nNone of this looks like an actual error. The results are plausible, the authors have a strong track record, and the wgl part is anchored by the explicit gl(N) formula in Section 4.1. But the submitted version is not fully checkable.\n\nWho is this for? Specialists in Vassiliev invariants, Lie algebra weight systems, and Hopf algebras of permutations. A general combinatorialist could read Section 3, but Section 4 requires a degree of trust.\n\nMy recommendation: this deserves serious peer review. A good referee could likely make it work, but the editor should require the Zaitsev appendix (or a public preprint) and a complete proof of Theorem 4.11 before acceptance.","headline":"A solid extension of weight systems to permutations, but two load-bearing proofs—the so-weight system confluence and the Zaitsev appendix—are not verifiable from the submitted text.","tokens_in":25669,"tokens_out":2333,"would_cite":false,"duration_ms":28997,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05A05","16T05","17B10"],"pacs":[],"model":"deepseek-v4-flash","headline":"Arbitrary permutations inherit weight systems from Lie algebras through generalized Vassiliev relations.","keywords":["chord diagrams","weight systems","Vassiliev relations","generalized chord diagrams","hyper chord diagrams","permutations","Hopf algebras","KP hierarchy"],"falsifier":"Take $m=6$, list all permutations, and compute $w_{gl}$ by the recurrence of Figure 7 in every allowed order; then verify that each one-hyper-arc and two-hyper-arc alternating sum is zero. If any sum fails to vanish, or if the value on a single permutation depends on the order of application of the recurrence, the central claim fails.","tokens_in":24445,"feed_emoji":"🔀","tokens_out":11536,"duration_ms":132129,"temperature":0.7,"pith_summary":"Weight systems are functions on chord diagrams that satisfy Vassiliev's 4-term relations, and they lie behind finite-type knot invariants. This paper argues that the same notion makes sense for arbitrary permutations: it proposes one-hyper-arc and two-hyper-arc relations that restrict to the classical 4-term relations when the permutation is a fixed-point-free involution. The main claim is that the universal $gl$-weight system and the universal $so$-weight system, originally defined by local recurrence rules on permutations, satisfy these generalized relations, so a generalized weight system is a well-defined function on hyper chord diagrams modulo the new relations. The paper further shows that, after the Schur substitution, the average of the $gl$-weight system over permutations of $m$ elements is a linear combination of one-part Schur polynomials, and that any generating function made from these averages is a $\\tau$-function of the KP hierarchy. If the main claim is correct, every permutation carries a canonical ``weight'' determined by Lie-algebra machinery, and computations that were developed for chord diagrams work unchanged on all permutations.","feed_headline":"Weight systems now live on every permutation","feed_subtitle":"New one- and two-hyper-arc relations let gl- and so-weight systems extend from chord diagrams to all permutations.","key_machinery":"The objects that carry the argument are the one-hyper-arc and two-hyper-arc elements. A one-hyper-arc element is the alternating sum over the $2(\\ell-1)$ positions a free leg can take next to the $\\ell-1$ fixed legs of its own hyper edge; a two-hyper-arc element is the alternating sum over the $2\\ell$ positions next to the $\\ell$ legs of a second hyper edge. These sums generalize Vassiliev's 4-term relations, and for fixed-point-free involutions they reduce to them. The proof that $w_{gl}$ satisfies the relations rewrites each two-term difference in the two-hyper-arc sum using the recurrence of Figure 7, producing alternating sums in one fewer element that cancel pairwise; the $so$ system uses the analogous recurrence of Figure 13 together with a sign convention for reversing cycles, expressed through extended permutation graphs in which edges may have two heads or two tails. The Schur substitution, replacing the Casimir generators $C_k$ by one-part Schur polynomials $S_k$ via the Harish-Chandra isomorphism, is the key change of variables that makes the inverse-permutation duality and the averaging formula take their clean forms.","core_discovery":"The central assertion is Theorem 4.1: the $gl$-weight system on hyper chord diagrams satisfies the generalized Vassiliev relations, with the analogous statement for $so$ in Theorem 4.11. Here a hyper chord diagram is an arbitrary permutation of $m$ elements considered up to cyclic shift, and the generalized relations are the one-hyper-arc and two-hyper-arc alternating sums defined in Section 3.3. The paper also establishes Theorem 4.7, that after substituting one-part Schur polynomials for the Casimir generators, the average $A_m$ of $w_{gl}$ over all permutations of $m$ elements equals $S_m - a_2(N)(N+m-1)^2 S_{m-2} + a_4(N)(N+m-1)^4 S_{m-4} - \\cdots$, with the closed generating function $A(v)=((e^{v/2}-e^{-v/2})/v)^{N-1}$ given in Theorem 4.9, and Corollary 4.8, that generating functions of the form $1+\\sum_{m\\ge1} c_m A_m u^m$ are one-parameter families of KP $\\tau$-functions. The paper also gives a formula for $w_{gl}$ on the inverse permutation under the Schur substitution (Theorem 4.4) and a state-sum description of the standard-representation $so(N)$ weight system on arbitrary permutations (Theorem 4.13).","pith_inferences":["If the recurrence for $w_{gl}$ is consistent, the same proof strategy should apply to any Lie-algebra weight system that extends to permutations through a local recurrence, so the generalized relations likely hold for the whole classical series and for $gl(M|N)$; the paper mentions these as examples but does not state them as theorems.","The KP connection suggests that averages of the $so$-weight system, under an appropriate even-variable substitution, could also be $\\tau$-functions of the KP or KdV hierarchy; that is a natural testable extension not stated in the paper.","Because the paper does not identify the geometric source of the generalized relations, a promising direction is to look for a discriminant in a space of branched covers whose finite-type invariants produce exactly the one- and two-hyper-arc alternating sums; if found, it would explain why the relations are universal.","The rotational Hopf algebras introduced in Section 5.3 bypass the generalized relations entirely, so one could test whether every generalized weight system factors through the projection onto rotational equivalence classes; a positive answer would make the rotational algebra the minimal domain for Lie-algebra weight systems on permutations."],"forward_implications":["The generalized relations turn permutations into the input of weight-system theory: any function on permutations satisfying them is a generalized weight system, and the $gl$- and $so$-weight systems are the first examples.","The space of hyper chord diagrams modulo generalized Vassiliev relations becomes a graded commutative cocommutative Hopf algebra whose homogeneous subspaces split by cycle type, with the ordinary chord-diagram Hopf algebra as the $H(2)$ subalgebra.","The average of the $gl$-weight system over all permutations of $m$ elements, after Schur substitution, is a linear combination of one-part Schur polynomials, so the associated generating functions are KP $\\tau$-functions; this adds a family of combinatorial solutions to the KP hierarchy.","The $so$-weight system is not a specialization of $w_{gl}$: there is a linear combination of order-$7$ chord diagrams on which $w_{so}$ is nonzero while $w_{gl}$ vanishes.","For fixed-point-free involutions, the inverse-permutation duality implies that $w_{gl}$ in Schur variables contains no monomial with an odd number of odd-indexed variables $S_k$."],"supporting_citations":[{"why":"Supplies the recurrence defining the universal $gl$-weight system on permutations, which the paper proves satisfies the generalized Vassiliev relations.","marker":"[9, 23]"},{"why":"Supplies the universal $so$-weight system and its recurrence, the second object of the paper's main verification.","marker":"[10]"},{"why":"Introduces the original 4-term relations for chord diagrams that the generalized relations are designed to extend.","marker":"[21]"},{"why":"Provides the Hopf algebra structure on chord diagrams that the hyper chord Hopf algebra generalizes.","marker":"[12]"},{"why":"Gives the Jucys theorem used to count permutations by the number of boundary components, the combinatorial basis of the averaging formula.","marker":"[5]"},{"why":"Supplies the Hopf algebra homomorphism $X_0$ from the rotational algebra of permutations to polynomials, used to relate $w_{gl}$ to chromatic polynomials.","marker":"[7]"},{"why":"Supplies the analogous $Y_0$ homomorphism for the $so$-weight system on monotone permutations.","marker":"[15]"},{"why":"Provides the state-sum formula for the standard representation of $so(N)$ on chord diagrams that Theorem 4.13 extends to all permutations.","marker":"[1]"},{"why":"Establishes that linear combinations of one-part Schur polynomials give KP $\\tau$-functions, the fact behind Corollary 4.8.","marker":"[6, 20]"}],"fun_headline_variants":["Weight systems for every permutation","New relations extend weight systems to permutations","Generalized Vassiliev relations for all permutations","gl and so systems now work on any permutation"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the local recurrence rules defining the $gl$- and $so$-weight systems are consistent and total on all permutations, so that $w_{gl}$ and $w_{so}$ are genuine functions independently of the order of reduction; the averaging theorems additionally depend on an appendix that is not included in the supplied text.","fun_headline_variants_meta":{"raw":{"variants":["Weight systems for every permutation","New relations extend weight systems to permutations","Generalized Vassiliev relations for all permutations","gl and so systems now work on any permutation"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000306,"raw_usage":{"total_tokens":1752,"prompt_tokens":944,"completion_tokens":808,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":560,"completion_tokens_details":{"reasoning_tokens":755}},"tokens_in":560,"tokens_out":808,"duration_ms":10251,"temperature":1.0,"reasoning_tokens":755,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T12:20:35.860913+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $m=6$, list all permutations, and compute $w_{gl}$ by the recurrence of Figure 7 in every allowed order; then verify that each one-hyper-arc and two-hyper-arc alternating sum is zero. If any sum fails to vanish, or if the value on a single permutation depends on the order of application of the recurrence, the central claim fails.","supporting_citations":[{"cited_title":"Universal Polynomial $\\mathfrak{so}$ Weight System","cited_arxiv_id":"2411.11546","evidence_quote":"Supplies the universal $so$-weight system and its recurrence, the second object of the paper's main verification."},{"cited_title":"Vassiliev,Cohomology of knot spacesin: Advance in Soviet Math.v","cited_arxiv_id":null,"evidence_quote":"Introduces the original 4-term relations for chord diagrams that the generalized relations are designed to extend."},{"cited_title":"Kontsevich","cited_arxiv_id":null,"evidence_quote":"Provides the Hopf algebra structure on chord diagrams that the hyper chord Hopf algebra generalizes."},{"cited_title":"1 (1974), 107–112","cited_arxiv_id":null,"evidence_quote":"Gives the Jucys theorem used to count permutations by the number of boundary components, the combinatorial basis of the averaging formula."},{"cited_title":"The universal ${\\mathfrak gl}$-weight system and the chromatic polynomial","cited_arxiv_id":"2406.10562","evidence_quote":"Supplies the Hopf algebra homomorphism $X_0$ from the rotational algebra of permutations to polynomials, used to relate $w_{gl}$ to chromatic polynomials."},{"cited_title":"Chromatic polynomial and the $\\mathfrak{so}$ weight system","cited_arxiv_id":"2411.01128","evidence_quote":"Supplies the analogous $Y_0$ homomorphism for the $so$-weight system on monotone permutations."},{"cited_title":"Bar-Natan,On the Vassiliev knot invariants, Topology, 1995,34, 423–472","cited_arxiv_id":null,"evidence_quote":"Provides the state-sum formula for the standard representation of $so(N)$ on chord diagrams that Theorem 4.13 extends to all permutations."}],"review_version":1}