Uniformly Discrete Forests with Poor Visibility

Noga Alon

doi:10.1017/S0963548317000505

Uniformly Discrete Forests with Poor Visibility

Noga Alon

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

We prove that there is a set F in the plane so that the distance between any two points of F is at least 1, and for any positive ϵ < 1, and every line segment in the plane of length at least ϵ^-1-o(1), there is a point of F within distance ϵ of the segment. This is tight up to the o(1)-term in the exponent, improving earlierestimates of Peres, of Solomon and Weiss, and of Adiceam.

Original language	English (US)
Pages (from-to)	442-448
Number of pages	7
Journal	Combinatorics Probability and Computing
Volume	27
Issue number	4
DOIs	https://doi.org/10.1017/S0963548317000505
State	Published - Jul 1 2018
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Statistics and Probability
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1017/S0963548317000505

Cite this

@article{4c7cba31d84c43f69614a5da608a35ff,

title = "Uniformly Discrete Forests with Poor Visibility",

abstract = "We prove that there is a set F in the plane so that the distance between any two points of F is at least 1, and for any positive ϵ < 1, and every line segment in the plane of length at least ϵ-1-o(1), there is a point of F within distance ϵ of the segment. This is tight up to the o(1)-term in the exponent, improving earlierestimates of Peres, of Solomon and Weiss, and of Adiceam.",

author = "Noga Alon",

note = "Publisher Copyright: {\textcopyright} 2017 Cambridge University Press.",

year = "2018",

month = jul,

day = "1",

doi = "10.1017/S0963548317000505",

language = "English (US)",

volume = "27",

pages = "442--448",

journal = "Combinatorics Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "4",

}

TY - JOUR

T1 - Uniformly Discrete Forests with Poor Visibility

AU - Alon, Noga

PY - 2018/7/1

Y1 - 2018/7/1

N2 - We prove that there is a set F in the plane so that the distance between any two points of F is at least 1, and for any positive ϵ < 1, and every line segment in the plane of length at least ϵ-1-o(1), there is a point of F within distance ϵ of the segment. This is tight up to the o(1)-term in the exponent, improving earlierestimates of Peres, of Solomon and Weiss, and of Adiceam.

AB - We prove that there is a set F in the plane so that the distance between any two points of F is at least 1, and for any positive ϵ < 1, and every line segment in the plane of length at least ϵ-1-o(1), there is a point of F within distance ϵ of the segment. This is tight up to the o(1)-term in the exponent, improving earlierestimates of Peres, of Solomon and Weiss, and of Adiceam.

UR - http://www.scopus.com/inward/record.url?scp=85030864065&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030864065&partnerID=8YFLogxK

U2 - 10.1017/S0963548317000505

DO - 10.1017/S0963548317000505

M3 - Article

AN - SCOPUS:85030864065

SN - 0963-5483

VL - 27

SP - 442

EP - 448

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

IS - 4

ER -

Uniformly Discrete Forests with Poor Visibility

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this