#18567: LatticePoset: add maximal_sublattices_iterator()
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-wishlist
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/latticeposet__add_maximal_sublattices_iterator__|
4b47df9119878d94e5bee124765ff09bf2eb015a
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by jmantysalo):
* commit: => 4b47df9119878d94e5bee124765ff09bf2eb015a
Comment:
There is now some code that at least seems to work. This is quite
interesting optimization problem. Can this be made to real
`maximal_sublattices_iterator()` instead of `maximal_sublattices()` (that
internally generates some non-maximal sublattices and then discards them).
I tried googling some time, but find no algorithm for this. This is
somewhat ad hoc solution.
----
New commits:
||[http://git.sagemath.org/sage.git/commit/?id=4b47df9119878d94e5bee124765ff09bf2eb015a
4b47df9]||{{{Added a function.}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/18567#comment:2>
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.
