On higher dimensional point sets in general position
From MaRDI portal
Abstract: A finite point set in is in general position if no points lie on a common hyperplane. Let be the largest integer such that any set of points in with no members on a common hyperplane, contains a subset of size in general position. Using the method of hypergraph containers, Balogh and Solymosi showed that . In this paper, we also use the container method to obtain new upper bounds for when . More precisely, we show that if is odd, then , and if is even, we have . We also study the classical problem of determining the maximum number of points selected from the grid such that no members lie on a -flat. For fixed and , we show that �egin{equation*} a(d,k,n)leq Oleft(n^{frac{d}{2lfloor (k+2)/4
floor}(1-frac{1}{2lfloor(k+2)/4
floor d+1})}
ight), end{equation*} which improves the previously best known bound of due to Lefmann when is congruent to 0 or 1 mod 4.
This page was built for publication: On higher dimensional point sets in general position
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418851)