#17030: Knot Theory as a part of GSoC 2014.
-------------------------------------+-------------------------------------
Reporter: amitjamadagni | Owner: amitjamadagni
Type: task | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: algebraic | Resolution:
topology | Merged in:
Keywords: | Reviewers: Miguel Marco
Authors: Amit Jamadagni, | Work issues:
Miguel Marco | Commit:
Report Upstream: N/A | 2b36cda5875a5e0a1d49b1c60d1c4976c15b5a84
Branch: | Stopgaps:
u/amitjamadagni/ticket/17030 |
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by mmarco):
No, it is not the same as ncomponents. ncomponents counts how many
different pieces of rope are in the link. What i am talking about is about
pieces of the diagram that don't cross at all.
That is, the braid [1,1] has two connected components (that is, two pieces
of rope), but they have crossings between them, so they are in the same
part of the diagram.
Whereas the braid [1,3] has also two connected components (two pieces of
rope), but there is no crossing at all between them. The planar diagram is
just two separated planar diagrams.
This situation of "completely independent" pieces needs to be treated
separatedly in several methods. For instance, try to check how many
methods fail for things like Link([[1,1,2,2],[3,3,4,4]])
--
Ticket URL: <http://trac.sagemath.org/ticket/17030#comment:58>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
