#16347: Wilson's constructions of OA with 2 truncated groups
-------------------------------------+-------------------------------------
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/16347 | 2e463514ceb2fb48d3c6fdc2a3391055bfafe373
Dependencies: #16391, #16373 | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by vdelecroix):
* status: needs_review => needs_info
Comment:
Hi Nathann,
I do not like the fact that we would have to cache everything. Could we
instead cache the construction? In other words, have a function
{{{
@cached_function
def orthogonal_array_construction(n):
r"""
Return a triple `(k,f,args)` such that `k` is the maximum value
such that Sage knows how to build a `OA(k,n)` and `f(*args)` actually
return this `OA(k,n)`.
"""
}}}
Advantages:
- that function can be use to speed up both boolean and designs answers
of `orthogonal_array`.
- we can remove the current cache from `find_wilson_decomposition*` and
`TD_find_product_decomposition`
- it might be used later on to draw the tree of constructions.
I am not sure it is feasible, but without thinking too much, it looks like
a good solution.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/16347#comment:12>
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.
