#17173: Poset: faster is_distributive_lattice
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/poset__faster_is_distributive_lattice|
d69e73a0a0a655e4e1595a77cda807ccb017fb02
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
If I convert this to loop, I must have a working copy on Hasse diagram. Do
I then still have linear extension? I must find a minimal element of
subposet containing only meet-irreducible elements, i.e. a meet-
irreducible element that is not greater than any other meet-irreducible
element. For a poset `P` I can found it just looping throught `P` --- it
will give elements by (some) linear extension.
In other words: If `G.vertices()` prints `..., a, ..., b, ...`, can it
after `D.delete_edges(...)` print `..., b, ..., a, ...`? If not, is this
guaranteed behaviour in following versions of Sage?
--
Ticket URL: <http://trac.sagemath.org/ticket/17173#comment:7>
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.
