Thanks for this Nicolas. After trolling through modules_with_basis.py I'd
also realised that leading_item() was more sensible:) The pointer to the
pdb module is also much appreciated. I still have some issues to sort out
but it is making more sense.
I worked out what is causing my code to take so long to invert these maps:
it is because the inverse map is defined as a linear morphism on the basis
of the codomain (=domain of the inverse) rather than by recursively
stripping off the leading terms. For my bases this turns out to be quite
inefficient but it seems tricky to do this nicely as the framework makes it
easy to describe maps from the F-basis to the C-basis in terms of what they
do to the F-basis elements whereas I really want to describe them in terms
of the basis { F(C(s)) }. Probably it makes no difference, however, as to
compute with the C-basis I need to rewrite everything in terms of the
F-basis, calculate there, and then push back to the C-basis.
Thanks again,
Andrew
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/sage-combinat-devel/-/1iVRfyh89C8J.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
To unsubscribe from this group, send email to
sage-combinat-devel+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/sage-combinat-devel?hl=en.
