#14003: Implementation of a rank symmetric test for posets
-----------------------------------+-----------------------------
Reporter: stumpc5 | Owner: sage-combinat
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: posets | Merged in:
Authors: Christian Stump | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
-----------------------------------+-----------------------------
Comment (by stumpc5):
See the attached patch above, which is basically
`L = [len(x) for x in P.level_sets()]`
`return all( L[i] == L[-i-1] for i in range(len(L)/2))`
But I do not know whether level sets are given for non-ranked posets...
--
Ticket URL: <http://trac.sagemath.org/ticket/14003#comment:9>
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.
