Papers
Topics
Authors
Recent
Search
2000 character limit reached

Products of simplices are canonically Ramsey

Published 16 Jul 2026 in math.CO | (2607.15264v1)

Abstract: A set of points C⊂R<sup>nC \subset \mathbb{R}<sup>n is called canonically Ramsey if there is some set of points $S\subset \mathbb{R}<sup>{n&#39;}$ such that any colouring of SS, using any number of colours, must contain either a monochromatic copy of CC or a rainbow copy of CC. Mao, Ozeki, and Wang introduced this notion, showing that 30-60-90 triangles are canonically Ramsey. Since then, various other canonically Ramsey configurations have been identified. The author showed that cuboids are canonically Ramsey, while Ge, Shu, Xu, and Yu recently showed that simplices are canonically Ramsey. We extend both of these results, proving that all products of simplices 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.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.