Products of simplices are canonically Ramsey
Combinatorics
2026-07-16 v1
Abstract
A set of points is called canonically Ramsey if there is some set of points such that any colouring of , using any number of colours, must contain either a monochromatic copy of or a rainbow copy of . 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.
Cite
@article{arxiv.2607.15264,
title = {Products of simplices are canonically Ramsey},
author = {Benedict Randall Shaw},
journal= {arXiv preprint arXiv:2607.15264},
year = {2026}
}
Comments
9 pages