#16559: Brouwer-Van Rees version of Wilson's decomposition
-------------------------------------+-------------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: needs_info
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 ncohen):
Yo !
> - Could we get rid of `simple_wilson_construction` from #16535 in this
ticket or should I open a new one?
Be careful, this ticket only depends on #16500 as it was meant to be very
local. If you want to touch other parts of the file you should base the
changes higher in the patch stack.
> - 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.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16559#comment:4>
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.
