Carson Crocker

A conditional transfer for colourings of R^n, with the conditional consequence χ(R^3) ≥ 7

Assume Theorem 2.3 (rigidity of wild character laws) of the OpenAI preprint The Euclidean plane is not five-colorable. We prove that, for every n ≥ 2 and every set Λ of positive real algebraic numbers, a Λ-avoiding k-colouring of Rn (with no regularity assumption) yields a conull...