#17023: Adding width() function to poset
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: positive_review
Priority: minor | Milestone: sage-wishlist
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Nathann Cohen | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/ticket/17023 | 99f8ed04511d4422eb0874a5332132b4058d8e34
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by chapoton):
* status: needs_review => positive_review
Old description:
> Add a `.widht()` -- i.e. number of elements in the longest antichain --
> to poset. Seems to have polynomial time algorithm based on Dilworth's
> Theorem.
New description:
Add a `.width()` -- i.e. number of elements in the longest antichain -- to
poset. Seems to have polynomial time algorithm based on Dilworth's
Theorem.
--
Comment:
I think the `s` in the list of methods should stay there for coherence of
this list.
As there is no `s` in the first line of the new functions, things are good
as they are.
LGTM. Let us not lose time on stupid things.
--
Ticket URL: <http://trac.sagemath.org/ticket/17023#comment:22>
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.
