#15310: Wilson's construction of Transversal Designs/Orthogonal Arrays/MOLS
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.2
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
combinatorics | Work issues:
Keywords: | Commit:
Authors: | f23fa885ee5a080f2a8051f23f7fc9f130541849
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/15310 |
Dependencies: |
#15287, #15431 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Yoooooooooooo !!
> I am not sure I would be able to do the full review.
PLeaaaaaaaaaaase.. I swear, all the results are checked before being
returned ! And the algorithms are so weird that the slightest typo would
make all results wrong `:-P`
> Nevertheless, you can can speed up '''a lot''' the function
`find_wilson_decomposition` using the fact that if a TD(k,n) exists then
we have the inequality `k <= n+1`.
Oh ?
> Here is a sample version of what can be done:
What does it change exactly ? That the `TD(k,u)` is not called when the
answer is obviously no ? Wouldn't we get the very same result by moving
the check of `TD(k,u)` to the top of the 4 tests ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/15310#comment:16>
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.
