Changes between Version 2 and Version 3 of Ticket #16391, comment 8
 Timestamp:
 06/03/14 11:35:32 (5 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Ticket #16391, comment 8
v2 v3 5 5 I 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 6 6 7 1) When k<=3 we know that it exists7 1) When x<=3 we know that it exists 8 8 9 9 2) When there is a `OA(k+1,n)` we know that it exists … … 17 17 > The multiplicity of TD(k,1) you obtain must strongly depend on the way you did your construction 18 18 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.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 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. 20 20 21 21 Nathann