#16231: Equivalence between OA/TD/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:         |  a9dce705211f5593b926c0512a40ada05d978ff3
  Nathann Cohen          |     Stopgaps:
Report Upstream:  N/A    |
         Branch:         |
  u/ncohen/16231         |
   Dependencies:         |
  #15310, #16227         |
-------------------------+-------------------------------------------------

Comment (by ncohen):

 Yo !

 > I added some documentation, please start editing from u/vdelecroix/16231

 Okay, I'll look at that right now.

 > If `n` is a prime power, there is an optimal construction, i.e. a
 `TD(n+1,n)` and there is no need to check for product or Wilson
 construction. But right now the code in `transversal_design` does. For
 prime powers there are two places where some code is implemented:
 > - in orthogonal_array (you refer to theorem 6.39 and 6.40 of Stinson)
 > - in mutually_orthogonal_latin_squares (you refer to section 6.4.1 of
 Stinson)
 > Are the outputs equivalent?

 No idea. They return valid answers, but I have no idea if they are the
 same. I would say "no", but really who cares ? Let's keep only one.

 > Note that there is no way to test it with the current code, unless I use
 the forbidden `who_asked` parameter.

 Am I guilty for that ?... `:-P`

 > Would it be possible to isolate the two constructions in two functions?
 Why do we need two constructions for the case of `n` being a prime power?

 I don't think we need two constructions of the same designs... I mean.
 AFTER this patch is merged, I don't think we need two, given that they all
 communicate with each other. BEFORE this patch, we actually need three
 different implementations `;-)`

 Nathann

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