Pith. sign in

REVIEW 4 major objections 5 minor 24 references

Generalized chord diagrams and weight systems

T0 review · 4 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Pith's one-line read Arbitrary permutations inherit weight systems from Lie algebras through generalized Vassiliev relations.

desk verdict 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. read the letter →

arxiv 2505.24491 v1 pith:DH7YLTZZ submitted 2025-05-30 math.CO math-phmath.MP

classification math.COmath-phmath.MP MSC 05A0516T0517B10
keywords chorddiagramsweightsystemsVassilievrelationsgeneralizedhyperpermutationsHopfalgebrasKPhierarchy
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

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.

What carries the argument

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.

What would settle it

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.

Watch

Extended reading notes

Core claim

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).

Load-bearing premise

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.

Editorial extensions

If this is right

  • 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$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • 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.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

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).

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 (4)
  1. [§4.6, Definition 4.3 and Fig. 13] 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.
  2. [§4.1, Theorem 4.1] 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.
  3. [§4.5, Theorems 4.7 and 4.9] 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.
  4. [§4.6, Theorem 4.11] 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.
minor comments (5)
  1. [Abstract] The word 'realted' in the abstract should be 'related'.
  2. [§4.5 heading] The section heading 'A veraging gl-weight system' contains a typo; it should read 'Averaging the gl-weight system.'
  3. [§5.3.3] 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 µ′.
  4. [§4.1, first bullet] 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.
  5. [§5.3, rotational equivalence] 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.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the generalized Vassiliev relations are defined independently, and the gl/so weight-system verifications are derived from recurrence rules anchored in explicit Lie-algebra trace formulas rather than from the relations themselves.

full rationale

The paper's central derivation is not circular. The generalized Vassiliev relations (Definitions 3.1 and 3.2) are new combinatorial definitions, independent of the weight systems. The gl-weight system is either defined by the explicit gl(N) trace formula or, in its universal form, by the recurrence in Fig. 7, which is cited to prior work [9,23] and is anchored to the trace formula. Theorem 4.1 proves that wgl satisfies the generalized relations by using this recurrence to telescope alternating sums; the recurrence is a local computational rule, not a fitted parameter, and the generalized relations range over all free-leg positions and cyclic shifts, so the theorem is a genuine deduction rather than a restatement of the definition. The so-weight system is introduced axiomatically in Definition 4.3, again with a recurrence rule, and Theorem 4.11 is asserted with a one-sentence proof; this is a proof gap and a well-definedness concern, but not circularity, because the axioms do not include the full generalized relations. Theorems 4.7 and 4.9 are stated as proved by M. Zaitsev in an appendix that is not included; this is an external-support and verifiability gap, not a circular reduction. The paper cites several previous works by the same authors for the recurrences and Hopf-algebra homomorphisms, but those citations provide parameter-free constructions and explicit formulas rather than an unverified uniqueness theorem, so they do not make the argument circular. No fitted input is renamed as a prediction, and no load-bearing claim reduces by construction to its own input.

Assumptions & free parameters 0 free parameters · 7 assumptions · 3 invented entities

The central claim is self-contained in the sense that the new relations are defined independently and then verified; no free parameters are fitted. The main external premises are the well-definedness of the previously constructed wgl/wso extensions, standard cited theorems (Harish-Chandra, Jucys, Milnor-Moore, KP tau-function characterization), and the missing appendix proof for Theorems 4.7 and 4.9. No physical entities are introduced.

assumptions (7)
  • domain assumption The wgl weight system on permutations is well-defined by the recurrence relations of Sec. 4.1 (multiplicativity, cyclic value C_m, and Fig. 7/9).
    The paper invokes the extension constructed in [9,23] without re-proving uniqueness or well-definedness; Theorems 4.1 and 4.11 and all subsequent results depend on this definition.
  • domain assumption The universal so-weight system is defined by the axioms in Definition 4.3 (multiplicativity, orientation reversal sign, even cyclic Casimir values C_m, and recurrence Fig. 13), and this definition is consistent.
    The paper takes these as defining axioms, with consistency argued from [10]; Theorem 4.11 relies on this definition.
  • standard math Harish-Chandra isomorphism identifies the center ZU(gl(N)) with symmetric functions in shifted variables, and the Perelomov-Popov formula relates Casimirs to Schur polynomials.
    Used in Sec. 4.3 to define the Schur substitution; cited from [18,19].
  • standard math Jucys' theorem on the generating function with Jucys-Murphy elements counts permutations by number of cycles.
    Used in proof of Theorem 4.6; cited [5].
  • standard math Any linear combination of one-part Schur polynomials is a tau-function for the KP hierarchy.
    Used in Corollary 4.8; cited [6,20].
  • standard math Milnor-Moore theorem describes connected graded commutative cocommutative Hopf algebras as polynomial Hopf algebras on primitives.
    Used in Sec. 5.1; cited [16].
  • domain assumption Zaitsev's Appendix proves Theorems 4.7 and 4.9.
    The paper states the theorem is proved in an appendix that is not included in the supplied text; the correctness of the averaging formula is assumed from that missing appendix.
invented entities (3)
  • Hyper arc and hyper chord diagrams
    purpose: Replace chord diagrams with arbitrary permutations modulo cyclic shift so that Lie algebra weight systems can be extended.
    New combinatorial objects defined in Sec. 3.2; they specialize to chord diagrams and carry a hypermap topology, but no empirical handle.
  • Generalized Vassiliev relations
    purpose: Define weight systems on permutations by generalizing the 4-term relations.
    New relations in Definitions 3.1 and 3.2; their validity as a framework is supported internally by Lemma 3.2 and Theorems 4.1 and 4.11.
  • Rotational Hopf algebras
    purpose: Provide Hopf algebra structures on permutations without factoring out Vassiliev-type relations.
    Defined in Sec. 5.3; dimension tables provide internal evidence but no external falsifiable prediction.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Generalized chord diagrams and weight systems." pith.science (2026). https://pith.science/paper/DH7YLTZZ

@misc{pith2026250524491,
  author       = {Pith},
  title        = {Pith review of: Generalized chord diagrams and weight systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DH7YLTZZ}},
  note         = {Machine review of arXiv:2505.24491}
}
abstract

Weight systems are functions on chord diagrams satisfying Vassiliev's $4$-term relations. They originate in the theory of finite type knot invariants. Recent developments in understanding weight systems arising from Lie algebras are based on extending these weight systems from chord diagrams (which can be interpreted as involutions without fixed points, considered modulo cyclic shifts) to arbitrary permutations (also modulo cyclic shifts). We suggest relations for functions on permutations, which generalize Vassiliev's relations. We show that the $gl$- and $so$- weight systems satisfy these relations. We also analyze certain properties of these weight systems and study realted Hopf algebras of permutations.

Figures

Figures reproduced from arXiv: 2505.24491 by the authors.

Figure 1
Figure 1. holds. f   a b   − f   a b   = f   a b   − f   a b   [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. An arc diagram and the corresponding chord diagram [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. A hyper chord diagram and the corresponding hyper arc diagrams; the hyper [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (9 more)
Figure 4
Figure 4. Figure 4: One-hyper-arc Vassiliev relation; the free leg is depicted as a white disc, while the fixed [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: A two-hyper-arc Vassiliev relation; the free leg is depicted as a white disc, while the [PITH_FULL_IMAGE:figures/full_fig_p008_5.png]
Figure 6
Figure 6. Figure 6: A two-hyper-chord generalized Vassiliev relation for hyper chord diagrams [PITH_FULL_IMAGE:figures/full_fig_p009_6.png]
Figure 7
Figure 7. Figure 7: The recurrence relation for the universal [PITH_FULL_IMAGE:figures/full_fig_p010_7.png]
Figure 8
Figure 8. Figure 8: An example of applying the recurrence relation shown in Fig. [PITH_FULL_IMAGE:figures/full_fig_p010_8.png]
Figure 9
Figure 9. Figure 9: The form the recurrence relation acquires for [PITH_FULL_IMAGE:figures/full_fig_p011_9.png]
Figure 11
Figure 11. Figure 11: In the center, the hypermap for the permutation [PITH_FULL_IMAGE:figures/full_fig_p013_11.png]
Figure 12
Figure 12. Figure 12: In the center, the hypermap for the permutation [PITH_FULL_IMAGE:figures/full_fig_p013_12.png]
Figure 13
Figure 13. Figure 13: The recurrence relation for the so-weight system wso     = −wso     By applying this transformation several times, every extended permutation graph can be reduced to a usual permutation graph (characterized by the additional property that every edge ha…

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

  1. [1]

    Bar-Natan,On the Vassiliev knot invariants, Topology, 1995,34, 423–472

    D. Bar-Natan,On the Vassiliev knot invariants, Topology, 1995,34, 423–472

  2. [2]

    Chmutov, S

    S. Chmutov, S. Duzhin, and J. Mostovoy,Introduction to Vassiliev Knot Invariants, Cam- bridge University Press, 2012

  3. [3]

    Chmutov, M

    S. Chmutov, M. Kazarian, and S. Lando,Polynomial graph invariants and the KP hierarchy, Selecta Math. New Series (2020) 26:34

  4. [4]

    анализ и его прил., 2007, 41:3, 48–59

    С.В.Дужин, М.В.Карев, Определение ориентации струнных зацеплений при помощи инвариантов конечного типа, Функц. анализ и его прил., 2007, 41:3, 48–59

  5. [5]

    1 (1974), 107–112

    A.-A.A.Jucys Symmetric polynomials and the center of the symmetric group ring, Reports on Mathematical Physics 5, no. 1 (1974), 107–112

  6. [6]

    B. B. Kadomtsev, V. I. Petviashvili,On the stability of solitary waves in weakly dispersive media, Sov. Phys. Dokl. 15: 539–541 (1970)

  7. [7]

    The universal ${\mathfrak gl}$-weight system and the chromatic polynomial

    M. Kazarian, N. Kodaneva, S. Lando The universal gl-weight system and the chromatic polynomial, arXiv:2406.10562

  8. [8]

    Kazarian, S

    M. Kazarian, S. Lando,Combinatorial solutions to integrable hierarchies, Russ. Math. Sur- veys, 70 (3) 453–482 (2015)

Show all 24 references
  1. [9]

    Kazarian, S

    M. Kazarian, S. Lando,Weight systems and invariants of graphs and embedded graphs, Russ. Math. Surveys,77 (5) 893–942 (2022)

  2. [10]

    Kazarian, Z

    M. Kazarian, Z. YangUniversal Polynomial so-Weight System, arXiv:2411.11546

  3. [11]

    Kodaneva, S

    N. Kodaneva, S. Lando Polynomial graph invariants induced from the gl-weight system, GEOPHY105421 (2025)

  4. [12]

    Kontsevich

    M. Kontsevich. Vassiliev knot invariants, in: Advances in Soviet Math., 16(2):137–150, 1993

  5. [13]

    S. Lando, On primitive elements in the bialgebra of chord diagrams, Translations of the American Mathematical Society-Series 2,180, 167–174, 1997, Providence [etc.] American Mathematical Society, 1949-

  6. [14]

    Lando and A

    S. Lando and A. Zvonkin,Graphs on Surfaces and Their Applications, 2003

  7. [15]

    Lando, Z

    S. Lando, Z. YangChromatic polynomial and theso-weight system, arXiv:2411.01128

  8. [16]

    Milnor, J

    J. Milnor, J. Moore,On the structure of Hopf algebras, Ann. of Math. (2) 81 (1965), 211–264

  9. [17]

    Okounkov, G

    A. Okounkov, G. Olshanski,Shifted Schur Functions, 1998, St. Petersburg Math. J. volume 9:2, 239–300

  10. [18]

    Topics in Representation Theory

    G. Olshanski, Representations of infinite-dimensional classical groups, limits of enveloping algebras and yangians, in “Topics in Representation Theory”, Advances in Soviet Math. 2, Amer. Math. Soc., Providence RI, 1991, pp. 1–66

  11. [19]

    A. M. Perelomov, V. S. Popov,Casimir operators for semisimple groups, Math. USSR Izv. Volume 2(6), p. 1313, 1968 32

  12. [20]

    Sato and Y

    M. Sato and Y. Sato,Soliton equations as dynamical systems on infinite dimensional Grass- mann manifolds, in: Nonlinear partial differential equations in applied science (Tokyo 1982), North-HollandMath. Stud., vol. 81, North- Holland, Amsterdam 1983, pp. 259–271

  13. [21]

    Vassiliev,Cohomology of knot spacesin: Advance in Soviet Math.v

    V. Vassiliev,Cohomology of knot spacesin: Advance in Soviet Math.v. 1, 1990, 23–69

  14. [22]

    Zhuoke Yang, On the Lie superalgebra gl(m|n) weight system, Journal of Geometry and Physics, Volume187, May 2023, 104808

  15. [23]

    ZhuokeYang, New approaches togl(N ) weight system, IzvestiyaMathematics,87:6, 150–166 (2023), arXiv:2202.12225 (2022)

  16. [24]

    Yordzhev, On the cardinality of a factor set in the symmetric group, Asian-European Journal of Mathematics, Vol

    K. Yordzhev, On the cardinality of a factor set in the symmetric group, Asian-European Journal of Mathematics, Vol. 7, No. 2 (2014) 1450027, doi: 10.1142/S1793557114500272 33

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.