#18347: implement the shard intersection order on permutations
-------------------------+-------------------------------------------------
Reporter: | Owner:
chapoton | Status: needs_work
Type: | Milestone: sage-6.7
enhancement | Resolution:
Priority: minor | Merged in:
Component: | Reviewers:
combinatorics | Work issues:
Keywords: poset | Commit:
Authors: | e32ecc3a9702cc7ab69ba180eb75f02623418186
Frédéric Chapoton | Stopgaps:
Report Upstream: N/A |
Branch: |
u/chapoton/18347 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by chapoton):
Thanks for the comments. I have corrected the two minor ones.
About the caching: indeed, this is used only in the poset, but used many
times.
It is not clear to me how to avoid that. One could precompute in the poset
method all
these digraphs, and keep them in a list or a dictionary, and make the
`shard_compares` method an internal one. I am not convinced that this
would make things more clear.
--
Ticket URL: <http://trac.sagemath.org/ticket/18347#comment:8>
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.
