2020
DOI: 10.48550/arxiv.2002.12440
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

The interlace polynomial of binary delta-matroids and link invariants

Abstract: In this work, we study the interlace polynomial as a generalization of a graph invariant to delta-matroids. We prove that the interlace polynomial satisfies the four-term relation for delta-matroids and determines thus a finite type invariant of links in the 3-sphere.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 10 publications
(16 reference statements)
0
2
0
Order By: Relevance
“…Theorem 2.6 (see [24] and [38]). At any primitive element the skew characteristic polynomial of a graph is a constant.…”
Section: 3mentioning
confidence: 99%
See 1 more Smart Citation
“…Theorem 2.6 (see [24] and [38]). At any primitive element the skew characteristic polynomial of a graph is a constant.…”
Section: 3mentioning
confidence: 99%
“…(see [49]). Theorem 4.6 (see [38]). The interlace polynomials of even binary delta-matroids satisfy the 4-term relations for these matroids.…”
Section: 3mentioning
confidence: 99%
“…Theorem 2.6 ([25], [39]). The skew characteristic polynomial of a graph on any primitive element is a constant.…”
Section: Graph Invariants and The Hopf Algebra Structurementioning
confidence: 99%
“…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%