Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cuboids are canonically Ramsey

Published 2 Mar 2026 in math.CO | (2603.02189v1)

Abstract: We say a set of points CR<sup>nC\subset \mathbb{R}<sup>n is canonically Ramsey if there is some set of points $S\subset \mathbb{R}<sup>{n&#39;}$ such that any colouring of SS, with any number of colours, admits either a monochromatic or rainbow copy of CC -- that is to say, some set of points congruent to CC either all receive the same colour, or all receive different colours. Mao, Ozeki, and Wang introduced this notion, proving that 30-60-90 triangles are canonically Ramsey, since when various other canonically Ramsey configurations have been identified (by Gehér, Sagdeev, and Tóth, and others). Fang, Ge, Shu, Xu, Xu, and Yang showed that all triangles and rectangles are canonically Ramsey, and asked whether all cuboids are canonically Ramsey. Here cuboids are sets of the form 0,b1××0,bs{0,b_1}\times\dots\times{0,b_s}, and in particular may have dimension greater than three. We resolve this question, proving that all cuboids are canonically Ramsey.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.