Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Setting (p. 173). A red–blue coloring of a Euclidean space is admissible if no two blue points are at distance one; an nn-coloring is proper if no color class contains two points at distance one; χ(S)\chi(S) is the least nn for which SS has a proper nn-coloring. An nn-point configuration is a set {a1,…,an}\{a_1,\ldots,a_n\} of nn points of Rm\mathbb{R}^m, and its translates are the sets A+vA+v.

An nn-coloring of Rm\mathbb{R}^m with classes C1,…,CnC_1,\ldots,C_n is regular (p. 174) if Ci=C1+viC_i=C_1+v_i for some fixed vectors v1,…,vnv_1,\ldots,v_n.

Proposition 2 (p. 174, quoted). "If Rm\mathbb{R}^m can be properly nn-colored by a regular coloring, then there exists an admissible two-coloring of Rm\mathbb{R}^m and an nn-point configuration AA so that translates of AA are forbidden in the red set."

The paper calls it a partial converse to Proposition 1, which bounds χ(Rm)≤n\chi(\mathbb{R}^m)\le n whenever an admissible coloring forbids red translates of an nn-point configuration (see Theorem 1's page).

Proof pointer

Section 2 (pp. 174--175). Normalize v1=0v_1=0, take A={v1,…,vn}A=\{v_1,\ldots,v_n\}, color C1C_1 blue and everything else red. The blue set avoids distance one because the coloring is proper. The proof shows that the points of any translate p+Ap+A lie in distinct classes, using Ca=C1+vaC_a=C_1+v_a and the identity (p+vi−va)+vj=(p+vj−va)+vi(p+v_i-v_a)+v_j=(p+v_j-v_a)+v_i; with nn classes and nn points, one point lies in C1C_1 and is blue.

Read depth

Claims checked: the definition of a regular coloring, Proposition 2 and its proof were read clause by clause on the page images of the print. Nothing here is independently reviewed.

Dependencies

None.

Source. A. D. Szlam, Monochromatic translates of configurations in the plane, J. Combin. Theory Ser. A 93 (2001), 173--176, doi:10.1006/jcta.2000.3065; the edition read is named on the source card.

Bears on

  • Problem 214: the proposition is the construction behind Theorem 2; it produces colorings that forbid red translates, not red congruent copies, and the paper draws no conclusion from it about the unit-square question.