#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:
-------------------------------------+-------------------------------------

Comment (by ncohen):

 Yo !

 > I do not like the fact that we would have to cache everything.

 Could you have missed the 10 000 posts about a new flag for the
 @cached_method decorator ?

 > 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)`.
 >     """
 > }}}

 You should not compute the largest k if you do not need to. If your
 function takes both k and n as an argument then it is Volker's idea.

 It actually isn't a bad idea, if not for the fact that there is no reason
 why we should go that far to implement a caching mechanism in
 combinat.designs while the caching mechanism has nothing to do with
 designs.

 The "clean/proper" solution is to implement a real caching mechanism for
 designs which takes k,n as input and answer accordingly, by only storing
 for each n the largest k that has been built so far, and the smallest k
 such that it has been proved that no OA(k,n) could built so far.

 This is what I want to do eventually, but I first wanted to get the actual
 constructions in ..... This is not a definitive solution but it is not the
 moment to implement a caching mechanism either... There are features to
 get in, really ...

 Nathann

 P.S. : When I say eventually I do not say "in two years". I say --> as
 soon as all the current patches are merged into Sage, along with the 4
 constructions I have been keeping on my hard drive waiting for all these
 patches to be reviewed.

--
Ticket URL: <http://trac.sagemath.org/ticket/16347#comment:13>
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.

Reply via email to