#18183: Implement two matroid polytopes
-------------------------+-------------------------------------------------
Reporter: | Owner:
chapoton | Status: needs_review
Type: | Milestone: sage-6.6
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
matroid theory | Work issues: documentation
Keywords: | Commit:
matroid polytope | 6484e7198d41b716f4cb70dcf56ea7d849a6ce90
Authors: | Stopgaps:
Frédéric Chapoton |
Report Upstream: N/A |
Branch: |
u/chapoton/18183 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Algorithmicaly it looks a bit weird to do something like that:
{{{
vertices = [ambient.sum(vector_e[convert[i]] for i in IS)
for r in range(self.full_rank() + 1)
for IS in self.independent_r_sets(r)]
}}}
You enumerate the 'r+1' independent sets without using the information you
got from the sets of order 'r'.
I don't know if it can be useful here, but there is something *very*
related in Sage:
http://www.sagemath.org/doc/reference/combinat/sage/combinat/subsets_hereditary.html
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/18183#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.
