#18549: Posets: 50x faster is_incomparable_chain_free
---------------------------------+-----------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-wishlist
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------+-----------------------------
Changes (by jmantysalo):
* cc: ncohen (added)
Comment:
An optimization question: Which is more propably for a random poset to
have: incomparable chains of size `n` and `n`, or of size `n-1` and `n+1`?
It sounds reasonable to except latter one.
If it so, the parameter (when it is a list of tuples) should be sorted
descending by difference of elements of the tuple. We want to return
``False`` as soon as possible.
--
Ticket URL: <http://trac.sagemath.org/ticket/18549#comment:1>
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.
