On higher dimensional point sets in general position

From MaRDI portal




Abstract: A finite point set in mathbbRd is in general position if no d+1 points lie on a common hyperplane. Let alphad(N) be the largest integer such that any set of N points in mathbbRd with no d+2 members on a common hyperplane, contains a subset of size alphad(N) in general position. Using the method of hypergraph containers, Balogh and Solymosi showed that alpha2(N)<N5/6+o(1). In this paper, we also use the container method to obtain new upper bounds for alphad(N) when dgeq3. More precisely, we show that if d is odd, then alphad(N)<Nfrac12+frac12d+o(1), and if d is even, we have alphad(N)<Nfrac12+frac1d−1+o(1). We also study the classical problem of determining the maximum number a(d,k,n) of points selected from the grid [n]d such that no k+2 members lie on a k-flat. For fixed d and k, 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 Oleft(nfracdlfloor(k+2)/2flooright) due to Lefmann when k+2 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)