The number of extreme pairs of finite point-sets in Euclidean spaces
From MaRDI portal
(Redirected from Publication:1087828)
For a set S of n points in \(E^ d\) let \(e^ k_ k(n)\) denote the maximum number of k-sets S' such that \(S'=S\cap h\), where h is a half space. Theorem. (i) \(e^ 2_ 2=\lfloor 3n/2\rfloor\) for \(n\geq 4\), (ii) \(e^ 3_ 2=10\) and \(e^ 3_ 2(n)=3n-6\) for \(n\geq 6\), (iii) \(e^ d_ 2(n)=\left( \begin{matrix} n\\ 2\end{matrix} \right)\) for \(4\leq d\leq n-2\).
Recommendations
Cites work
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- scientific article; zbMATH DE number 3804333 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3407703 (Why is no real title available?)
- On the combinatorial classification of nondegenerate configurations in the plane
- On the number of line separations of a finite set in the plane
- The number of small semispaces of a finite set of points in the plane
Cited in
(10)- The number of small semispaces of a finite set of points in the plane
- More on k-sets of finite sets in the plane
- A combinatorial result about points and balls in Euclidean space
- On stable line segments in all triangulations of a planar point set
- The number of extreme triples of a planar point set
- The number of double-normals in space
- scientific article; zbMATH DE number 3921378 (Why is no real title available?)
- Double-normal pairs in space
- Point sets with many \(k\)-sets
- Large convexly independent subsets of Minkowski sums
This page was built for publication: The number of extreme pairs of finite point-sets in Euclidean spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087828)