#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):
Yo !
> This one was much easier once the Wilson construction is understood!
Yep yep. That's what I will remember of design theory. Deadly scary stuff
that becomes totally straightforward once you pay attention to it.
Still, a lot of stuff remains deadly scary in the field `:-P`
> Do you already did the even more general construction from Brouwer-Rees
1982 (they consider generalization of truncated OA where the extra columns
are partitioned in possibly more than two parts)?
Now yet, but I will have to. What scares me is not the implementation of
the construction, but how to properly write the input part of the function
`T_T`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16500#comment:27>
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.
