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.\}
scientific article; zbMATH DE number 4212078