#17888: Implement check for modular elements and if a poset is supersolvable
-------------------------------------+-------------------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Travis Scrimshaw | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/combinat/supersolvable_posets-17888|
571eb2794a02107acdf40a93b4f377c75e9082da
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by git):
* commit: 67d4910e6a250f6a2713777cb442af9f04c0e5b2 =>
571eb2794a02107acdf40a93b4f377c75e9082da
Comment:
Branch pushed to git repo; I updated commit sha1. New commits:
||[http://git.sagemath.org/sage.git/commit/?id=571eb2794a02107acdf40a93b4f377c75e9082da
571eb27]||{{{Fixing my errors and going from maximal elements down.}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/17888#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.
