#19011: Add Jones representation of braid groups and Jones polynomials of braid
closures
-------------------------------------+-------------------------------------
Reporter: fuglede | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.9
Component: algebraic | Resolution:
topology | Merged in:
Keywords: | Reviewers:
Authors: Søren Fuglede | Work issues:
Jørgensen | Commit:
Report Upstream: N/A | 41ab2f36558329ff0d3083685b2906928c3c6a09
Branch: | Stopgaps:
u/fuglede/jones_rep |
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by fuglede):
The above commits introduce caching in a number of ways, building on your
comments. For the TL representation, the actual TL-part of the algorithm
(which is independent of choices of variables) is cached in all cases. The
actual (memory heavy) result is stored for the typical case where no
variable is specified. The Markov traces and Jones polynomials have been
setup so that the combinatorial part of the calculation is done over the
general ring; the result of this is cached, and when the user specifies a
variable, substitution is carried out on this cached result. I think this
strikes the perfect balance.
Also, as suggested by tscrim, the paradigm of supplying the variable as a
generator of some polynomial ring, rather than specifying a string and the
ring, has been pushed.
--
Ticket URL: <http://trac.sagemath.org/ticket/19011#comment:28>
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.
