#12916: Dedekind-MacNeil completion of finite posets
-------------------------+-------------------------------------------------
Reporter: | Owner: sage-combinat
nthiery | Status: needs_info
Type: | Milestone: sage-wishlist
enhancement | Resolution:
Priority: minor | Merged in:
Component: | Reviewers:
combinatorics | Work issues:
Keywords: | Commit:
poset, lattice | 4321c96292f81ba516b825e5b387b7b3bcca07a4
Authors: | Stopgaps:
Frédéric Chapoton |
Report Upstream: N/A |
Branch: |
u/chapoton/12916 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by chapoton):
Hello Nathann,
thanks for the input.
Here is a proposal for another algorithm, using maximal cliques of the
incomparability graph of an auxiliary poset. Needs polishing. I do not
know if this is faster than before, hopefully yes.
--
Ticket URL: <http://trac.sagemath.org/ticket/12916#comment:9>
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.
