The replacements of signed graphs and Kauffman brackets of link families (Q2370826)

From MaRDI portal
Revision as of 06:15, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The replacements of signed graphs and Kauffman brackets of link families
scientific article

    Statements

    The replacements of signed graphs and Kauffman brackets of link families (English)
    0 references
    29 June 2007
    0 references
    In an earlier paper [Adv. Appl. Math. 34, No. 1, 47--64 (2005; Zbl 1060.05041)], the authors used a signed version of the Read-Whitehead chain polynomial [\textit{R. C. Read} and \textit{E. G. Whitehead, jun.} Discrete Math. 204, No.~1--3, 337--356 (1999; Zbl 0960.05050)] to describe the Kauffman brackets of certain families of links. In the current paper they observe that the sheaf polynomial can be used in the same way. As an example of the technique they give an explicit formula for the Kauffman bracket of a rational link.
    0 references
    Kauffman bracket
    0 references
    graph polynomial
    0 references
    signed graph
    0 references
    rational link
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references