Convex and discrete geometry Discrete and combinatorial geometry Problem
Danzer set
Builds on Convex bodyLebesgue measure
Problem
Let . A set is a Danzer set if it meets every convex body in of volume , where volume is Lebesgue measure. Is there a Danzer set of bounded density? This means that there is a constant such that every ball of radius contains at most points of .
Remarks
Ludwig Danzer asked the question; it is listed as a problem of Danzer in the proceedings of a convexity colloquium held in Copenhagen in 1965. The question is open. Bambah and Woods showed in 1971 that a finite union of lattices is never a Danzer set. They also constructed Danzer sets with at most points in a ball of radius , by overlaying rectangular grids of different shapes. Solomon and Weiss gave a construction with points, and they showed that the vertex sets of substitution tilings, such as Penrose tilings, are not Danzer sets.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Borel sigma-algebra concept
- Convex body concept
- Euclidean space object
- Outer measure concept
- Lebesgue measure object
- Danzer set problem
Further reading
About this page
| Tag | MMHWS2TC2A |
|---|---|
| URI | m2://MMHWS2TC2A |
| Kind | problem |
| Writing | W0 stub |
| MSC | 52C17, 52A37, 52C23 |
| Status | This copy of the site has no build data. Run m2 status MMHWS2TC2A. |
| About | Convex body |
| Uses | Convex body, Lebesgue measure |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.