#16500: New recursive constructions of Orthogonal Arrays
-------------------------------------+-------------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-6.3
Component: combinatorial | Resolution:
designs | Merged in:
Keywords: | Reviewers: Vincent Delecroix
Authors: Nathann Cohen | Work issues:
Report Upstream: N/A | Commit:
Branch: u/ncohen/16500 | 697dd0ca8284485897b051015af74b385c345fb4
Dependencies: #16499 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
> > This one was much easier once the Wilson construction is understood!
Some smarter comment: I believe that it is thanks to work like the one we
do that we can get to understand such things. That's how it happened to me
with LP : I had to implement very basic things 1000 times for Sage, and in
the end I find myself understanding the basics properly, which would have
NEVER happened if I had just had a book in front of me. Or even if it was
in Sage's code.
When you implement Sage stuff you are forced to spend time on things you
would quickly look at otherwise.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16500#comment:28>
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.
