On the combinatorics of smoothing

DOI10.1007/S10958-016-2802-5zbMATH Open1347.57013arXiv1303.7383OpenAlexW1582091042MaRDI QIDQ289736FDOQ289736

Authors: Micah W. Chrisman 

Publication date: 31 May 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1303.7383

Recommendations

• The self-smoothing number of knots and links
• A bracket polynomial for graphs. I
• On Invariants of Graphs with Applications to Knot Theory
• Knot invariants from Laplacian matrices
• Smoothing resolution for the Alexander-Conway polynomial

zbMATH Keywords

spectral graph theoryknotsloop counting

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15)

Cites Work

• Eigenspaces of graphs
• An introduction to the theory of graph spectra
• Knots.
• Introduction to Vassiliev knot invariants
• Virtual knot theory
• Graph-links
• A matrix for computing the Jones polynomial of a knot
• POLYAK–VIRO FORMULAS FOR COEFFICIENTS OF THE CONWAY POLYNOMIAL
• A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
• Twist lattices and the Jones-Kauffman polynomial for long virtual knots
• Title not available (Why is that?)
• Parity in knot theory and graph-links
• Elementary combinatorics of the HOMFLYPT polynomial
• A bracket polynomial for graphs. I

Cited In (3)

• Title not available (Why is that?)
• On the smoothing problem
• Smoothing analysis of multicolour pattern schemes

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)