#13507: implements the order polytope and chain polytope of a poset
-------------------------------------+--------------------------------------
Reporter: chapoton | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.9
Component: combinatorics | Resolution:
Keywords: poset, polytope | Work issues:
Report Upstream: N/A | Reviewers: Alejandro Morales
Authors: Frédéric Chapoton | Merged in:
Dependencies: | Stopgaps:
-------------------------------------+--------------------------------------
Comment (by ahmorales):
In line 2909 you can indent
"Discrete Comput. Geom. (1986), :doi:`10.1007/BF02187680` "
so that the documentation displays better.
Also, in the order polytope would the method be more efficient in
generating the polytope if you include:
1. inequality for each cover relation (as it is currently done)
2. x >= 0 for minimal elements x and x <= 1 for maximal elements (instead
of doing both inequalities for all elements of the poset).
Other than this it looks good.
Replying to [comment:4 chapoton]:
> Here is a new patch.
>
> I have just enhanced the reference, using the new doi role introduced in
#14011.
>
> Please review !
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13507#comment:5>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
