Nearly all known Euclidean Ramsey sets are subsoluble

Abstract

A finite set X in a Euclidean space Rd is called Ramsey if for every k there exists an integer n such that whenever Rn is coloured with k colours, there is a monochromatic copy of X. Graham conjectured that all spherical sets are Ramsey, but progress on this conjecture has been slow. A key result of Kr\'iz is that all sets that embed in sets that are acted on transitively by a soluble group are Ramsey. We show that for nearly all known examples of Ramsey sets the converse is true, with only two possible exceptions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…