#19221: Some new (n,2^k,1)-BIBD
-------------------------------------------------+-------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status:
Priority: major | needs_info
Component: combinatorial designs | Milestone: sage-6.9
Keywords: | Resolution:
Authors: Nathann Cohen | Merged in:
Report Upstream: N/A | Reviewers: Vincent
Branch: | Delecroix
78d008dce6ad2f415dc703861b529f6fa0e95841 | Work issues:
Dependencies: | Commit:
| Stopgaps:
-------------------------------------------------+-------------------------
Comment (by ncohen):
> Are there any (combinatorial/graph theory) constructors in Sage with
parameter `labels=` ?
Don't know exactly. I was thinking of adding one in
`posets.BooleanLattice`. You also have the
'digraphs.DeBruijn(vertices="strings")', which I forgot in the list of the
names that get adapted to every specific situation. Probably others, I
don't know.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19221#comment:30>
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.
