#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|
c50b9868ae1b4b17e9df96bf7f12bcf5b982fe30
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by chapoton):
I have tried to enhance the doc.
I also propose to cache the modular property inside "is_supersolvable", so
that one does not check twice that an element is modular or not. What do
you think ? (the line with @cached_function is currently commented out)
--
Ticket URL: <http://trac.sagemath.org/ticket/17888#comment:12>
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.
