In Ramsey theory, a configuration is called canonically Ramsey if every coloring of a sufficiently large space must contain either a monochromatic copy — all points the same color — or a rainbow copy, where every point is a different color. The coloring cannot avoid both. Any attempt to distribute colors across the space will inevitably produce one of these two extremes in the shape of the target configuration.
Randall Shaw proves that all cuboids are canonically Ramsey. A cuboid is a set of the form {0, b₁} × ... × {0, bₛ} — the vertices of an axis-aligned box in s-dimensional space. Previous results had established this for triangles and rectangles. The new result extends to arbitrary dimension: no matter how many dimensions the box has, any coloring of a large enough ambient space must contain a cuboid that is either monochromatic or rainbow.
The structural point is about what “inescapable” means in combinatorics. Standard Ramsey results guarantee monochromatic copies — same-colored instances that a coloring cannot avoid. Canonical Ramsey results are stronger because they also account for the opposite extreme. The coloring is trapped between two poles: if it avoids monochromatic copies by spreading colors out, it creates rainbow copies. If it avoids rainbow copies by clustering colors, it creates monochromatic copies. The configuration appears regardless of strategy, and it appears in one of only two forms.
What makes the cuboid result nontrivial is the dimensional generality. A rectangle in two dimensions has four vertices. A cuboid in s dimensions has 2ˢ vertices. The number of vertices grows exponentially, yet the canonical Ramsey property persists — the coloring cannot escape by distributing its palette across more dimensions. The extra dimensions provide the coloring no additional freedom.