#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 | 8202cf5754bcecd608e1dfb2c189eb7846febb6c
Branch: | Stopgaps:
u/fuglede/jones_rep |
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by tscrim):
That's why I suggested doing the optimization of just returning the
polynomial for the default values (rather than running a useless `subs`).
Sometimes taking a slowdown in smaller examples is worth it for the
significant speedup in larger examples. Without seeing your timings, I
can't tell (I don't have access to Sage right now). However it sounds like
refactoring the code and caching only the result of the first loop is
best.
For variables/rings, from my experience it is more common to take as input
the variable, rather than creating the ring itself in the method (unless
there is a default input). See, e.g., `sage.combinat.q_analogues`.
Also a micro-optimization: `if len(forest) == 0:` is slower than `if not
forest:`.
--
Ticket URL: <http://trac.sagemath.org/ticket/19011#comment:17>
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.
