#16277: MOLS constructions rom the Handbook of Combinatorial Designs
-------------------------------------+-------------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.2
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Nathann Cohen | Reviewers:
Report Upstream: N/A | Work issues:
Branch: u/ncohen/16277 | Commit:
Dependencies: #16248, #16231, | 490aa7e9c919ef8bd62d9da41489c3825ff14f72
#16269, #16058 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
As I said, I don't mind as I know that it is painful to edit.
The point is that in the future, somebody might come and ask: for a given
k,n how many '''different''' TD(k,n) do I have? But an equality test is
far from an isomorphism test, so please leave it.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/16277#comment:15>
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.
