#17888: Implement check for modular elements and if a poset is supersovable
-----------------------------+------------------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.6
Component: combinatorics | Keywords:
Merged in: | Authors: Travis Scrimshaw
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+------------------------------------
This adds an option to check if a set of elements are modular (and by
extension, if you pass a singleton, then that element is modular). This
also checks if a lattice is supersolvable, that is to say there exists a
maximal chain of modular elements.
--
Ticket URL: <http://trac.sagemath.org/ticket/17888>
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.
