#16559: Brouwer-Van Rees version of Wilson's decomposition
-------------------------------------+-------------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.3
Component: combinatorial | Resolution:
designs | Merged in:
Keywords: | Reviewers:
Authors: Nathann Cohen | Work issues:
Report Upstream: N/A | Commit:
Branch: u/ncohen/16559 | 30370573b908d3f1f132f1fa87ced73326e1b9b4
Dependencies: #16500 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Replying to [comment:4 ncohen]:
> > - You should provide at least a possibly stupid but non-trivial
example of the new construction.
>
> Are all applications of Wilson's theorem that we have in Sage at the
moment "trivial" ? Because that function handles them all `:-P`
>
> The thing is that it is not possible to use this construction for as
long as `incomplete_orthogonal_arrays` does not handle holes of size >1.
You can provide the OA explicitly. I mean: as it is, the function gives
nothing new! Or more precisely, it does but only in principle... the only
current positive effect is to slow down the Wilson construction!
I really think that it is a good thing to have. But with no application in
mind it is a bit premature. I will try to build a non-already existing
example from the Brouwer-Van Rees paper.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/16559#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.
