A combinatorial model for the homfly polynomial
The paper gives a combinatorial model for the homfly polynomial, which is derived from the Conway-type algorithm used to compute the homfly polynomial of an arbitrary link diagram. It is an expansion of the homfly polynomial in terms of circuit partitions. The paper first introduces a matrix formalism for the homfly algorithm. This formalism is used to express the main result as a matrix inversion formula, which is proved in a wider context where non-planar graphs are permitted. Different aspects and consequences of the result are also discussed. \{The erratum gives the missing page 558.\}
- Combinatorics and topology - François Jaeger's work in knot theory
- Hypergraph polynomials and the Bernardi process
- On the HOMFLY polynomials of even trigonal bipyramid links
- scientific article; zbMATH DE number 6683138 (Why is no real title available?)
- scientific article; zbMATH DE number 6683152 (Why is no real title available?)
- POLYAK–VIRO FORMULAS FOR COEFFICIENTS OF THE CONWAY POLYNOMIAL
- The polynomial and linear hierarchies in models where the weak pigeonhole principle fails
- The transition matroid of a 4-regular graph: an introduction
- Oriented state model of the Jones polynomial and its connection to the dichromatic polynomial
- Elementary combinatorics of the HOMFLYPT polynomial
- A combinatorial model for Bessel polynomials
- Root polytopes and Jaeger‐type dissections for directed graphs
- Gauss diagram formulae for Vassiliev invariants from Kauffman polynomial
- Plane graphs and link invariants
- Modèles combinatoires pour les polynômes de Meixner
- Composition products and models for the homfly polynomial
This page was built for publication: A combinatorial model for the homfly polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810041)