Seifert circles, braid index and the algebraic crossing number (Q2577121): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Studying links via closed braids. III: Classifying links which are closed 3-braids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the braid index of links with nested diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braids and the Jones Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hecke algebra representations of braid groups and link polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial invariant of oriented links / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-variable polynomial of cable knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: An index of a graph with applications to knot theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4107635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the crossing number of positive knots and braids and braid index criteria of Jones and Morton-Williams-Franks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimal number of Seifert circles equals the braid index of a link / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE INDEX OF GRAPHS: INDEX VERSUS CYCLE INDEX / rank
 
Normal rank

Latest revision as of 14:17, 11 June 2024

scientific article
Language Label Description Also known as
English
Seifert circles, braid index and the algebraic crossing number
scientific article

    Statements

    Seifert circles, braid index and the algebraic crossing number (English)
    0 references
    16 December 2005
    0 references
    In this paper the authors consider the conjecture that link diagrams with minimum number of Seifert circles determine the writhe uniquely. They investigate some class of diagrams for which the operation introduced in [\textit{K. Murasugi} and \textit{J. H. Przytycki}, Mem. Am. Math. Soc. 508 (1993; Zbl 0792.05047)] and [\textit{D. A. Chalcraft}, Math. Proc. Cambridge Philos. Soc. 111 (2), 273--281 (1992; Zbl 0753.57004)] may reduce Seifert circles effectively. The possibility of arriving at diagrams with the same number of Seifer circles but different writhes is discussed. The authors introduce other reducing operations and finally translate the problem into one of graph theory.
    0 references
    0 references
    0 references
    Seifert circle
    0 references
    writhe
    0 references
    0 references
    0 references
    0 references