A lower bound for weak \(\varepsilon\)-nets in high dimension (Q1611071): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00454-001-0090-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2066690102 / rank | |||
Normal rank |
Latest revision as of 00:48, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A lower bound for weak \(\varepsilon\)-nets in high dimension |
scientific article |
Statements
A lower bound for weak \(\varepsilon\)-nets in high dimension (English)
0 references
15 July 2003
0 references
A finite set \(N\subset \mathbb{R}^{d}\) is called a weak \(\varepsilon \)-net for an \(n\)-point set \(X\subset \mathbb{R}^{d}\) if it intersects each convex set \(K\) with \(\left|K\cap X\right|\geq \varepsilon n\). It is shown that there are point sets in \(\mathbb{R}^{d}\) for which every weak \(\frac{1}{50}\)-net has at least \(const\cdot e^{\sqrt{d/2}}\) points. The best available upper bound for the size of a weak \(\varepsilon \)-net with fixed \(\varepsilon >0\) is \(d^{O(d)}\).
0 references
weak epsilon-nets
0 references