Wiki
Wiki

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

Updated


Statement

Setting (pp. 2--5, 7). m1(R2)m_1(\mathbb R^2) is the supremum of the upper densities of measurable planar sets with no two points at distance 11 (p. 2). Tl1,l2,αT_{l_1,l_2,\alpha} is the flat torus spanned by v⃗1,v⃗2\vec v_1,\vec v_2 with ∣v⃗1∣=l1|\vec v_1|=l_1, ∣v⃗2∣=l2|\vec v_2|=l_2 and angle α∈(0,π/2]\alpha\in(0,\pi/2], ρ\rho is its metric induced by the Euclidean metric (Definitions 3 and 4, p. 3), and the torus is perfectly periodic when ρ(p1,p2)≠1\rho(p_1,p_2)\ne1 implies that no lattice translate of p2−p1p_2-p_1 has length 11 (Definition 5, p. 5). diam⁡(F)\operatorname{diam}(F) is the diameter of F⊂Tl1,l2,αF\subset T_{l_1,l_2,\alpha} in ρ\rho.

Let Tl1,l2,α=F1⊔⋯⊔FnT_{l_1,l_2,\alpha}=F_1\sqcup\cdots\sqcup F_n be a partition of a perfectly periodic torus into measurable sets with diam⁡(Fi)<1\operatorname{diam}(F_i)<1 for every ii, and let pi∈Fip_i\in F_i be arbitrary points. Let G=(V,E)G=(V,E) be an undirected graph on V={p1,…,pn}V=\{p_1,\ldots,p_n\} whose edge set satisfies, for all 1≤i<j≤n1\le i<j\le n,

(pi,pj)∉E ⟹ ρ(q1,q2)≠1for all q1∈Fi, q2∈Fj(p_i,p_j)\notin E\ \Longrightarrow\ \rho(q_1,q_2)\ne1\quad\text{for all }q_1\in F_i,\ q_2\in F_j

(p. 7).

Lemma 3 (p. 7). If M⊂{p1,…,pn}M\subset\{p_1,\ldots,p_n\} is an independent set of GG, then

m1(R2)≥∑pi∈Mλ2(Fi)∑j=1nλ2(Fj),m_1(\mathbb R^2)\ge\frac{\sum_{p_i\in M}\lambda_2(F_i)}{\sum_{j=1}^n\lambda_2(F_j)},

where λ2\lambda_2 is planar Lebesgue measure.

The edge condition is one-sided: any graph with at least the forced edges qualifies, and the paper notes that fewer edges lead to a larger maximum independent set (p. 8).

Source. Alexander Tolmachev, On lower bounds of the density of planar periodic sets without unit distances, arXiv:2411.13248v2 (11 Apr 2025): Lemma 3 and the graph condition on p. 7, its proof on pp. 7--8, Definitions 3--5 on pp. 3 and 5. The edition read is identified on the source card.

Read depth. Claims checked: the statement, the graph condition and the definitions it uses were read clause by clause on the printed pages, and the proof was read. Nothing here is independently reviewed.

Proof pointer

Pages 7--8. Let AA be the union of the pieces FiF_i with pi∈Mp_i\in M and A^\hat A its periodic extension to the plane by the lattice spanned by v⃗1,v⃗2\vec v_1,\vec v_2; A^\hat A is measurable with density λ2(A)/λ2(torus)\lambda_2(A)/\lambda_2(\text{torus}). Two points of A^\hat A at Euclidean distance 11 project to points of one piece, at torus distance below 11, or of two non-adjacent pieces, at torus distance not 11; in both cases perfect periodicity rules out a Euclidean distance of 11 between any lattice translates, so A^\hat A avoids distance 11.

Dependencies

Definitions 3--5 (pp. 3, 5) of the same paper. Used for Theorem 1 (p. 10), where the pieces are the nmnm equal hexagons of the grid.

Bears on

  • Problem 1070: the lemma gives lower bounds on m1(R2)m_1(\mathbb R^2), and the problem page records the bound f(n)≥m1(R2) nf(n)\ge m_1(\mathbb R^2)\,n of Larman and Rogers, which this paper does not state; so each independent set the lemma accepts yields a lower bound for f(n)/nf(n)/n. The paper reports no value above Croft's 0.229360.22936, and the lemma neither improves the known estimates of f(n)f(n) nor decides whether f(n)≥n/4f(n)\ge n/4.