The C-complex clasp number of links
From MaRDI portal
Publication:2192239
Abstract: In the 1980's Daryl Cooper introduced the notion of a C-complex (or clasp-complex) bounded by a link and explained how to compute signatures and polynomial invariants using a C-complex. Since then this was extended by works of Cimasoni, Florens, Mellor, Melvin, Conway, Toffoli, Friedl, and others to compute other link invariants. Informally a C-complex is a union of surfaces which are allowed to intersect each other in clasps. The purpose of the current paper is to study the minimal number of clasps amongst all C-complexes bounded by a fixed link . This measure of complexity is related to the number of crossing changes needed to reduce to a boundary link. We prove that if is a 2-component link with nonzero linking number, then the linking number determines the minimal number of clasps amongst all C-complexes. In the case of 3-component links, the triple linking number provides an additional lower bound on the number of clasps in a C-complex.
Recommendations
Cites work
- A geometric construction of the Conway potential function
- A geometric interpretation of Milnor's triple linking numbers
- Generalized Seifert surfaces and signatures of colored links
- scientific article; zbMATH DE number 3131611 (Why is no real title available?)
- scientific article; zbMATH DE number 3759175 (Why is no real title available?)
- scientific article; zbMATH DE number 3623614 (Why is no real title available?)
- scientific article; zbMATH DE number 877622 (Why is no real title available?)
- Some relations among various numerical invariants for links
Cited in
(4)
This page was built for publication: The C-complex clasp number of links
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192239)