Back to Search
Start Over
On the density of sets avoiding parallelohedron distance 1
- Source :
- Bachoc, C, Bellitto, T, Moustrou, P & Pêcher, A 2019, ' On the Density of Sets Avoiding Parallelohedron Distance 1 ', Discrete & Computational Geometry, vol. 62, no. 3, pp. 497-524 . https://doi.org/10.1007/s00454-019-00113-x, Discrete and Computational Geometry, Discrete and Computational Geometry, 2019, 62 (3), pp.497-524. ⟨10.1007/s00454-019-00113-x⟩, Discrete and Computational Geometry, Springer Verlag, 2019, 62 (3), pp.497-524. ⟨10.1007/s00454-019-00113-x⟩
- Publication Year :
- 2017
- Publisher :
- arXiv, 2017.
-
Abstract
- The maximal density of a measurable subset of $${{\mathbb {R}}}^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\ge 2$$ .
- Subjects :
- 050101 languages & linguistics
Parallelohedron
[SHS.INFO]Humanities and Social Sciences/Library and information sciences
Dimension (graph theory)
1991Mathematics Subject Classification.52C10, 52B11, 11H06
Polytope
02 engineering and technology
Space (mathematics)
Theoretical Computer Science
Combinatorics
Mathematics - Metric Geometry
TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY
52C10, 52B11, 11H06
[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
0202 electrical engineering, electronic engineering, information engineering
FOS: Mathematics
Discrete Mathematics and Combinatorics
Mathematics - Combinatorics
0501 psychology and cognitive sciences
[MATH.MATH-MG]Mathematics [math]/Metric Geometry [math.MG]
Mathematics
chromatic numbers
05 social sciences
Chromatic number
Metric Geometry (math.MG)
Distance graphs
Lattices
Euclidean distance
Computational Theory and Mathematics
Parallelohedra
020201 artificial intelligence & image processing
Geometry and Topology
Combinatorics (math.CO)
Voronoi diagram
Subjects
Details
- ISSN :
- 01795376 and 14320444
- Database :
- OpenAIRE
- Journal :
- Bachoc, C, Bellitto, T, Moustrou, P & Pêcher, A 2019, ' On the Density of Sets Avoiding Parallelohedron Distance 1 ', Discrete & Computational Geometry, vol. 62, no. 3, pp. 497-524 . https://doi.org/10.1007/s00454-019-00113-x, Discrete and Computational Geometry, Discrete and Computational Geometry, 2019, 62 (3), pp.497-524. ⟨10.1007/s00454-019-00113-x⟩, Discrete and Computational Geometry, Springer Verlag, 2019, 62 (3), pp.497-524. ⟨10.1007/s00454-019-00113-x⟩
- Accession number :
- edsair.doi.dedup.....823b4320aa1d60e0fb521189765e4f2e
- Full Text :
- https://doi.org/10.48550/arxiv.1708.00291