This seems to disagree with my version of your bound above in some cases. The smallest is s(5,7). The true optimum is 5/3
Ah yes, I lost sight of the possibility that the expression I was seeking would sometimes be lower than m/3 (whereas the actual bound from this approach can't be). I meant
s' = max [ m/3, min [ m-n/p, n/(p+1) ]]
but I'm less and less confident that I was right, so if you have cases where this expression is still different from the bound you've calculated, let me know and I'll have another go :-) It would be very nice to get an explicit expression for the bound, whatever it is.
no subject
Ah yes, I lost sight of the possibility that the expression I was seeking would sometimes be lower than m/3 (whereas the actual bound from this approach can't be). I meant
s' = max [ m/3, min [ m-n/p, n/(p+1) ]]
but I'm less and less confident that I was right, so if you have cases where this expression is still different from the bound you've calculated, let me know and I'll have another go :-) It would be very nice to get an explicit expression for the bound, whatever it is.
would you like me to credit you as
I should be honoured!