On the Density of Sets Avoiding Parallelohedron Distance 1

Discrete & Computational Geometry(2019)

引用 6|浏览0
暂无评分
摘要
The maximal density of a measurable subset of ℝ^n avoiding Euclidean distance 1 is unknown except in the trivial case of dimension 1. In this paper, we consider the case of a distance associated to a polytope that tiles space, where it is likely that the sets avoiding distance 1 are of maximal density 2^-n , as conjectured by Bachoc and Robins. We prove that this is true for n=2 , and for the Voronoi regions of the lattices A_n , n≥ 2 .
更多
查看译文
关键词
Distance graphs,Parallelohedra,Lattices,Chromatic number
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要