#17030: Knot Theory as a part of GSoC 2014.
-------------------------------------+-------------------------------------
Reporter: amitjamadagni | Owner: amitjamadagni
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.9
Component: algebraic | Resolution:
topology | Merged in:
Keywords: | Reviewers: Miguel Marco, Karl-
Authors: Amit Jamadagni, | Dieter Crisman, Frédéric Chapoton
Miguel Marco | Work issues:
Report Upstream: N/A | Commit:
Branch: | 8f4ec1977612c42da767931683dae92ba17e4bb0
public/ticket/17030 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by fuglede):
Sounds reasonable enough. One thing I didn't consider by the way, is how
long it actually takes to make the relevant conversions between the planar
diagram and braid presentations of links.
And by the way, one could of course ask the same question about Alexander
polynomials. Here, the algorithms are much more comparable and the
difference might boil down to micro-optimisations(?):
[[Image(https://gist.githubusercontent.com/fuglede/da35ac110ee17dc06beb/raw/c8f80d6f3d10d917a099d9559c58674b59cf686e/alexandercombined.png)]]
On a related note, I think it would make sense to take the closure-related
methods from {{{Braid}}} and refactor into {{{Link}}}, just because they
logically fit there.
--
Ticket URL: <http://trac.sagemath.org/ticket/17030#comment:138>
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.
