#19197: LatticePoset: add breadth()
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/latticeposet__add_breadth__|
8d81130c3ea697cbfe3ce178dd5a7fac052e78d3
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
> OK... So you think something like
There is no need to check that it is an antichain. Also, if you do not
write it as a lambda function you have more freedom and do not need to
create sets at each test, test.
>btw, what is faster way to iterate over "list `L` minus an element for
every element"?
What's wrong with `L[:i] + L[i+1:]` ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19197#comment:6>
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.
