Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Published pp. 1–3 and 5, Definitions 1 and 6 and Section 2 (canonical PDF). The corresponding arXiv labels are Definitions 1.1 and 3.4.
For an integer and a real , write
A regular polygonal torus is a finite orthogonal Cartesian product , where , and . Only the vertices are included. The source permits , interpreted as two antipodal points. If all , the product is -regular. If also all , it is -regular, denoted . A common polygon order does not require a common radius.
An embedding preserves every Euclidean distance, without rescaling. For , a -embedding of a finite set into is an injection satisfying
The error is in squared distance. Injectivity is an additional condition, not a consequence of an unrestricted additive error bound.
A simplex is a finite affinely independent configuration. For labeled points , affine independence means that and force all . Single points are included; the empty configuration has only vacuous embedding and Ramsey assertions. The substantive proofs take .
A finite configuration is Ramsey if, for every integer , there is a dimension such that every coloring contains a monochromatic isometric copy of . Here . The dimension may depend on the configuration and number of colors. This is an all-color assertion, stronger than a fixed two-color statement.
Every centered torus above lies on a sphere of radius . This radius belongs to the containing product. An embedded subset can have a smaller intrinsic circumradius, namely the radius about its equidistant center in its own affine hull. No definition here identifies those radii or prescribes the radius of a Ramsey witness.
The exact correction of nearly equal squared distances is in Lemma 4, and regular expansions are treated in the expansion identity.