Transition Polynomial as a Weight System for Binary Delta-Matroids

Alexander, Dunaykin,; Zhukov, Vyacheslav

doi:10.17323/1609-4514-2022-22-1-69-81

Cited by 4 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Theorem 1.10 (see [25]). By setting w(χ) = t, w(ϕ) = −t, and w(ψ) = s for the weight function the transition polynomial becomes a weight system taking values in the ring of polynomials C[t, s, x].…”

Section: Remark the Transformation G → G ′mentioning

confidence: 99%

See 1 more Smart Citation

Weight systems and invariants of graphs and embedded graphs

Kazarian

Lando

2022

Russian Math. Surveys

View full text Add to dashboard Cite

The recent progress in the theory of weight systems, which are functions on the chord diagrams satisfying the so-called 4-relations, is described. Most attention is given to methods for constructing concrete weight systems. The two main sources of the constructions discussed are invariants of the intersection graphs of chord diagrams that satisfy the 4-term relations for graphs, and metrized Lie algebras. In the simplest non-trivial case of the metrized Lie algebra $\mathfrak{sl}(2)$ the recent results on the explicit form of the generating functions of the values of a weight system on important series of chord diagrams are presented. The computations are based on the Chmutov-Varchenko recurrence relations. Another recent result presented is the construction of recurrence relations for the values of the $\mathfrak{gl}(N)$-weight system. These relations are based on Kazarian's idea of extending the $\mathfrak{gl}(N)$-weight system to arbitrary permutations. In a number of recent papers an approach to the extension of weight systems and graph invariants to arbitrary embedded graphs was proposed, which is based on an analysis of the structure of the relevant Hopf algebras. The main principles of this approach are described. Weight systems defined on embedded graphs correspond to finite-order invariants of links ('knots' with several components). Bibliography: 65 titles.

show abstract

Section: Remark the Transformation G → G ′mentioning

confidence: 99%

“…These two operations are extended to an arbitrary subset A ⊂ E. This definition is a specialization of the definition of the weighted transition polynomial in [12]. Theorem 4.9 (see [25]). The transition polynomials of even binary delta-matroids satisfy the 4-term relations for these delta-matroids.…”

Section: 3mentioning

confidence: 99%

Weight systems and invariants of graphs and embedded graphs

Kazarian

Lando

2022

Russian Math. Surveys

View full text Add to dashboard Cite

show abstract

“…Theorem 1.10 ( [26]). By choosing w(χ) = t, w(φ) = −t, w(ψ) = s, for the weight function, we make the transition polynomial into a weight system taking values in the ring of polynomials C[t, s, x].…”

Section: Transition Polynomialmentioning

confidence: 99%

Weight systems and invariants of graphs and embedded graphs

Kazaryan¹,

Lando²

2023

Preprint

View full text Add to dashboard Cite

“…For the skew characteristic polynomial, this is not true, and we use only the knowledge of the value of the extended invariant on primitives. Extensions of graph invariants to delta-matroids in their relationship with knot and link invariants are studied also in [2,11].…”

Section: -Term Relation For Graphsmentioning

confidence: 99%

Skew characteristic polynomial of graphs and embedded graphs

Dogra,

Lando

2023

Communications in Mathematics

View full text Add to dashboard Cite

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For nonoriented simple graphs the definition is different, but for a certain class of graphs (namely, for intersection graphs of chord diagrams), it gives the same answer if we endow such a graph with an orientation induced by the chord diagram. We prove that this invariant satisfies Vassiliev's $4$-term relations and determines therefore a finite type knot invariant. We investigate the behaviour of the polynomial with respect to the Hopf algebra structure on the space of graphs and show that it takes a constant value on any primitive element in this Hopf algebra. We also provide a two-variable extension of the skew characteristic polynomial to embedded graphs and delta-matroids. The $4$-term relations for the extended polynomial prove that it determines a finite type invariant of multicomponent links.

show abstract

Transition Polynomial as a Weight System for Binary Delta-Matroids

Cited by 4 publications

References 0 publications

Weight systems and invariants of graphs and embedded graphs

Weight systems and invariants of graphs and embedded graphs

Weight systems and invariants of graphs and embedded graphs

Skew characteristic polynomial of graphs and embedded graphs

Contact Info

Product

Resources

About