2016arXiv (Cornell University)Open access

Sets in Almost General Position

Mili\'cevi\'c, Luka

Open full text 0 citations

Abstract

Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$ points in almost general position with no more than $o(n)$ points in general position. Cardinal, T\'oth and Wood extended this result to $\mathbb{R}^3$, finding sets of $n$ points with no 5 on a plane whose subsets with no 4 points on a plane have size $o(n)$, and asked the question for higher dimensions: for given $n$, is it still true that the largest subset in general position we can guarantee to find has size $o(n)$? We answer their question for all $d$ and derive improved bounds for certain dimensions.

Open-access reader

About this research paper

What this paper is about

Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$ points in almost general position with no more than $o(n)$ points in general position. Cardinal, T\'oth and Wood extended this result to $\mathbb{R}^3$, finding sets of $n$ points with no 5 on a plane whose subsets with no 4 points on a plane have size $o(n)$, and asked the question for higher dimensions: for given $n$, is it still true that the largest subset in general position we can guarantee to find has size $o(n)$? We answer their question for all $d$ and derive improved bounds for certain dimensions.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$ points in almost general position with no more than $o(n)$ points in general position. Cardinal, T\'oth and Wood extended this result to $\mathbb{R}^3$, finding sets of $n$ points with no 5 on a plane whose subsets with no 4 points on a plane have size $o(n)$, and asked the question for higher dimensions: for given $n$, is it still true that the largest subset in general position we can guarantee to find has size $o(n)$? We answer their question for all $d$ and derive improved bounds for certain dimensions.

Key concepts: General position, Position (finance), Plane (geometry), Combinatorics, Set (abstract data type), Mathematics, Geometry, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Sets in Almost General Position — Research Paper | ScholarLens