Changes between Version 2 and Version 3 of Ticket #16391, comment 8


Ignore:
Timestamp:
06/03/14 11:35:32 (5 years ago)
Author:
ncohen
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #16391, comment 8

    v2 v3  
    55I need those designs for constructions of OA that we cannot build at the moment, and I have no other way to produce them. What is the problem with seeing this function as
    66
    7 1) When k<=3 we know that it exists
     71) When x<=3 we know that it exists
    88
    992) When there is a `OA(k+1,n)` we know that it exists
     
    1717> The multiplicity of TD(k,1) you obtain must strongly depend on the way you did your construction
    1818
    19 We have no proof of that. And I did not claim the contrary, but we have no proof of that. For instance the proof that it always exists when k<=3 is the proof that any OA contains an independent set of size 3, which means that the result will always hold in this case regardless of which OA is returned.
     19We have no proof of that. And I did not claim the contrary, but we have no proof of that. For instance the proof that it always exists when x<=3 is the proof that any OA contains an independent set of size 3, which means that the result will always hold in this case regardless of which OA is returned.
    2020
    2121Nathann