Abstract: Many invariants of knots rely upon smoothing the knot at its crossings. To compute them, it is necessary to know how to count the number of connected components the knot diagram is broken into after the smoothing. In this paper, it is shown how to use a modification of a theorem of Zulli together with a modification of the spectral theory of graphs to approach such problems systematically. We give an application to counting subdiagrams of pretzel knots which have one component after oriented and unoriented smoothings.
Recommendations
Cites work
- scientific article; zbMATH DE number 3678765 (Why is no real title available?)
- A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
- A bracket polynomial for graphs. I
- A matrix for computing the Jones polynomial of a knot
- An introduction to the theory of graph spectra
- Eigenspaces of graphs
- Elementary combinatorics of the HOMFLYPT polynomial
- Graph-links
- Introduction to Vassiliev knot invariants
- Knots.
- POLYAK–VIRO FORMULAS FOR COEFFICIENTS OF THE CONWAY POLYNOMIAL
- Parity in knot theory and graph-links
- Twist lattices and the Jones-Kauffman polynomial for long virtual knots
- Virtual knot theory
Cited in
(5)
This page was built for publication: On the combinatorics of smoothing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289736)