On the density of sets of the Euclidean plane avoiding distance 1

10/01/2018
by   Thomas Bellitto, et al.
0

A subset A ⊂ R^2 is said to avoid distance 1 if: ∀ x,y ∈ A, x-y _2 ≠ 1. In this paper we study the number m_1( R^2) which is the supremum of the upper densities of measurable sets avoiding distance 1 in the Euclidean plane. Intuitively, m_1( R^2) represents the highest proportion of the plane that can be filled by a set avoiding distance 1. This parameter is related to the fractional chromatic number χ_f( R^2) of the plane. We establish that m_1( R^2) ≤ 0.25646 and χ_f( R^2) ≥ 3.8992.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/22/2023

Packing unequal disks in the Euclidean plane

A packing of disks in the plane is a set of disks with disjoint interior...
research
10/06/2020

On Euclidean Steiner (1+ε)-Spanners

Lightness and sparsity are two natural parameters for Euclidean (1+ε)-sp...
research
09/13/2017

Geometric clustering in normed planes

Given two sets of points A and B in a normed plane, we prove that there ...
research
06/21/2021

A PTAS for k-hop MST on the Euclidean plane: Improving Dependency on k

For any ϵ>0, Laue and Matijević [CCCG'07, IPL'08] give a PTAS for findin...
research
12/21/2020

Escaping an Infinitude of Lions

We consider the following game played in the Euclidean plane: There is a...
research
11/29/2021

Shortcutting Fast Failover Routes in the Data Plane

In networks, availability is of paramount importance. As link failures a...

Please sign up or login with your details

Forgot password? Click here to reset