A combinatorial property of points and ellipsoids
From MaRDI portal
(Redirected from Publication:911052)
Let \({\mathbb{R}}^ d\) be d-dimensional Euclidean space. The authors prove that there exists a constant \(c_ d>0\) with the following property: for every finite set \(X\subset {\mathbb{R}}^ d\) there is \(Y\subset X\) with at most \(\lfloor (1/4)d(d+3)\rfloor +1\) points such that the arbitrary ellipsoid \(E\supset Y\) contains at least \(c_ d| X|\) points. It is also shown that the bound of the number of points of Y is best possible.
Recommendations
- A combinatorial result about points and balls in Euclidean space
- Minimal ellipsoids and their duals
- Minimum Ellipsoids
- Grid and cloud computing for the modeling of the motion of a magnetized assymmetric body in an external magnetic field
- A combinatorial property of points and balls, a colored version
Cites work
Cited in
(11)- A combinatorial result on points and circles on the plane
- Minimal ellipsoids and their duals
- A combinatorial result about points and balls in Euclidean space
- A combinatorial property of convex sets
- A Beck-Fiala-type theorem for Euclidean norms
- Point-ellipse configurations and related topics
- A combinatorial property of points and balls, a colored version
- scientific article; zbMATH DE number 4212059 (Why is no real title available?)
- scientific article; zbMATH DE number 4161081 (Why is no real title available?)
- On geodesic disks enclosing many points
- On combinatorial properties of spheres in euclidean spaces
This page was built for publication: A combinatorial property of points and ellipsoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911052)
