#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 vdelecroix):
Replying to [comment:9 vdelecroix]:
> Replying to [comment:8 chapoton]:
> And you should really think moving it somewhere else as this has
nothing to do with permutations. This is just a comparability graph given
by the inclusion order on intervals. Isn't it?
This is not quite true, sorry. You are building a comparability graph that
also does depend on the order of the input. Not only on the intervals
themselves...
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/18347#comment:10>
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.
