We show that a much stronger upper bound exists by reducing the problem to a variant of the Hales-Jewett problem. We also prove a lower bound of the same type. Finally, an entirely different approach can be used to prove a very small upper bound on a simplified variant of the Graham's number problem.
Joint work with Mitchell Lee and John Mackey.
Back to the ACO home page