#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|
67d4910e6a250f6a2713777cb442af9f04c0e5b2
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by tscrim):
* status: needs_work => needs_review
Comment:
Replying to [comment:5 chapoton]:
> Replying to [comment:4 tscrim]:
> You're right. It would be good to never check twice if some element is
modular.
It's tomorrow...ish. I've implemented a backtracing version of
`is_supersolvable`.
> ok, I understand. Maybe we can have a function is_modular_element, then
?
I've added such a method.
--
Ticket URL: <http://trac.sagemath.org/ticket/17888#comment:8>
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.
