2 ms·
Absolutely - you seem to have nailed every point. The only thing you've missed is this - we now know that for C=2 the minimal length required to force a sub-se
by ColinWright 13y ago
Absolutely - you seem to have nailed every point.
The only thing you've missed is this - we now know that for C=2 the minimal length required to force a sub-sequence of discrepancy >=2 is 1161. The technique used gives a hint of how fast this dependency might grow, and that might give clues about techniques that probably won't work.
It also seems clear that a similar brute-force check of C>=3 won't be possible. Knowing these things gives clues as to how we might now proceed.