A spanning tree expansion of the Jones polynomial (Q1090974): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q56456437, #quickstatements; #temporary_batch_1711574657256
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Jonathan A. Hillman / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jonathan A. Hillman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0040-9383(87)90003-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068033618 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56456437 / rank
 
Normal rank

Latest revision as of 00:01, 28 March 2024

scientific article
Language Label Description Also known as
English
A spanning tree expansion of the Jones polynomial
scientific article

    Statements

    A spanning tree expansion of the Jones polynomial (English)
    0 references
    0 references
    1987
    0 references
    This paper presents a reformulation of the bracket polynomial of Kauffman (and hence of the Jones polynomial) for an oriented link, based on ideas related to the Tutte polynomial of graph theory. The bracket polynomial is expressed as a sum of monomials, indexed by the set of spanning trees of the graph associated with a black-and-white colouring of the regions of a link diagram. Some interesting connections between the crossing number of alternating link diagrams and the reduced degree (''breadth'') of the Jones polynomial (also observed in part by Kauffman and by Murasugi) follow from this approach.
    0 references
    0 references
    bracket polynomial
    0 references
    Jones polynomial
    0 references
    oriented link
    0 references
    Tutte polynomial
    0 references
    crossing number of alternating link diagrams
    0 references
    0 references
    0 references