#18415: Cleanup of documentation in combinat.nscf_qsym
-------------------------------------+-------------------------------------
Reporter: zabrocki | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.7
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: zabrocki | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/combinat/zabrocki/ncsf_qsym_doc_cleanup/18415|
aa9301dc7d835896d3e2b9cf1be415ce78f448aa
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by zabrocki):
One todo indicated that the coercions between multiplicative bases should
probably be algebra morphisms rather than module morphisms. I checked and
the example {{{S(basis[1,2,3,4,5,6])}}} and {{{basis(S[1,2,3,4,5,6])}}} in
had a roughly x4 speedup for each basis elementary/Phi/Psi. I went ahead
and implemented `_to/from_complete_on_generators` and deleted
`_to/from_complete_on_basis` for the Phi and Psi bases.
--
Ticket URL: <http://trac.sagemath.org/ticket/18415#comment:4>
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.
