Graph-valued invariants of virtual and classical links and minimality problem
classification
🧮 math.GT
keywords
linksminimalitybracketclassicalcomplexitycomponentconsiderconstruct
read the original abstract
In the present paper, we construct the generalized Kuperberg bracket for two-component links with one component fibred. We consider a new geometrical complexity for such links and establish minimality of diagrams in a strong sense.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.