Transitive sets in Euclidean Ramsey theory
From MaRDI portal
Publication:654894
DOI10.1016/J.JCTA.2011.09.005zbMATH Open1232.05224arXiv1012.1350OpenAlexW2026183660MaRDI QIDQ654894FDOQ654894
Authors: Imre Leader, Paul A. Russell, Mark Walters
Publication date: 23 December 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Abstract: A finite set in some Euclidean space is called Ramsey if for any there is a such that whenever is -coloured it contains a monochromatic set congruent to . This notion was introduced by Erdos, Graham, Montgomery, Rothschild, Spencer and Straus, who asked if a set is Ramsey if and only if it is spherical, meaning that it lies on the surface of a sphere. This question (made into a conjecture by Graham) has dominated subsequent work in Euclidean Ramsey theory. In this paper we introduce a new conjecture regarding which sets are Ramsey; this is the first ever `rival' conjecture to the conjecture above. Calling a finite set transitive if its symmetry group acts transitively---in other words, if all points of the set look the same---our conjecture is that the Ramsey sets are precisely the transitive sets, together with their subsets. One appealing feature of this conjecture is that it reduces (in one direction) to a purely combinatorial statement. We give this statement as well as several other related conjectures. We also prove the first non-trivial cases of the statement. Curiously, it is far from obvious that our new conjecture is genuinely different from the old. We show that they are indeed different by proving that not every spherical set embeds in a transitive set. This result may be of independent interest.
Full work available at URL: https://arxiv.org/abs/1012.1350
Recommendations
- scientific article; zbMATH DE number 1182901
- Finite Euclidean Ramsey theory
- Ramsey numbers for transitive tournaments
- scientific article; zbMATH DE number 16112
- A note on Euclidean Ramsey theory
- Schreier sets in Ramsey theory
- A Euclidean Ramsey theorem
- On some problems of Euclidean Ramsey theory
- scientific article; zbMATH DE number 1341925
- Euclidean Ramsey theorems. I
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Euclidean Ramsey theorems. I
- Regularity and Positional Games
- Title not available (Why is that?)
- All trapezoids are Ramsey
- All Triangles are Ramsey
- Title not available (Why is that?)
- A Partition Property of Simplices in Euclidean Space
- Recent trends in Euclidean Ramsey theory
- Permutation Groups in Euclidean Ramsey Theory
- Finite subtransitive sets
- All regular polytopes are Ramsey
Cited In (17)
- Exactly \(m\)-coloured complete infinite subgraphs
- Ramsey theory in the \(n\)-space with Chebyshev metric
- On a Frankl-Wilson theorem
- A Ramsey characterisation of eventually periodic words
- Transitive sets and cyclic quadrilaterals
- On a Frankl-Wilson theorem and its geometric corollaries
- Finite subtransitive sets
- All finite sets are Ramsey in the maximum norm
- Suborbits in Knaster's problem
- Max-norm Ramsey theory
- Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions
- Interview with David Conlon
- Transitive edge coloring of graphs and dimension of lattices
- Polychromatic Euclidean-Ramsey theorems
- Almost all sets of \(d+2\) points on the (\(d-1\))-sphere are not subtransitive
- Simplices and regular polygonal tori in Euclidean Ramsey theory
- A HALES–JEWETT TYPE PROPERTY OF FINITE SOLVABLE GROUPS
This page was built for publication: Transitive sets in Euclidean Ramsey theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654894)