#13991: Mitigate speed regressions in symmetric function related code due to
#12313
----------------------------------+-----------------------------------------
Reporter: nbruin | Owner: sage-combinat
Type: task | Status: new
Priority: major | Milestone: sage-5.8
Component: combinatorics | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: #13605, #14225 | Stopgaps:
----------------------------------+-----------------------------------------
Comment (by nthiery):
Hi guys!
Replying to [comment:47 nbruin]:
> The most important value of this exercise I think is as a case-study
into the pitfalls of getting good performance relating to complicated
parent structures. I'd hope you'll eventually find some general guidelines
people should follow if they want their code to perform reasonably well.
Sorry for jumping a bit late in the discussion.
Thanks for investigating this. I just wanted to say to not worry too
much about k-Schur functions, except as an interesting case
study. Except for a few people, this is not an intensively used
feature. And those few people doing some intensive calculations should
be in charge of optimizing the code.
Also, from the top of my head, the k in k-Schur is basically the same
as that for the Weyl group (+-1). So there won't be many groups
created and it indeed would make a lot of sense to keep a reference to
that Weyl group in the appropriate parent.
Cheers,
Nicolas
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13991#comment:48>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
