The Hadwiger-Nelson problem over certain fields

preprint2015arXivOpen access

Abstract

We compute the Hadwiger-Nelson numbers χ(E2)χ(E^2) for certain number fields EE, that is, the smallest number of colors required to color the points in the plane with coordinates in~EE so that no two points at distance 11 from one another have the same color. Specifically, we show that χ(Q(2)2)=2χ(\mathbb{Q}(\sqrt{2})^2) = 2, that χ(Q(3)2)=3χ(\mathbb{Q}(\sqrt{3})^2) = 3, that χ(Q(7)2)=3χ(\mathbb{Q}(\sqrt{7})^2) = 3 despite the fact that the graph Γ(Q(7)2)Γ(\mathbb{Q}(\sqrt{7})^2) is triangle-free, and that 4≤χ(Q(3,11)2)≤54 \leq χ(\mathbb{Q}(\sqrt{3}, \sqrt{11})^2) \leq 5. We also discuss some results over other fields, for other quadratic fields. We conclude with some comments on the use of the axiom of choice.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.