#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: | 878ed3a0794d123c46d7cb9ea48ad93ca2d07348
Frédéric Chapoton | Stopgaps:
Report Upstream: N/A |
Branch: |
u/chapoton/18347 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by vdelecroix):
Hi,
Replying to [comment:19 chapoton]:
I mostly agree with you for 2. and 4. But if you do not care about the
elements, then the poset should be abstract on integers: i.e. just store a
matrix of relations and send it to `Poset`. You do not want to know which
permutation corresponds to which point in this poset?
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/18347#comment:20>
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.
