6 research outputs found
General Position Subsets and Independent Hyperplanes in d-Space
Erd\H{o}s asked what is the maximum number such that every set of
points in the plane with no four on a line contains points in
general position. We consider variants of this question for -dimensional
point sets and generalize previously known bounds. In particular, we prove the
following two results for fixed :
- Every set of hyperplanes in contains a subset
of size at least , for some
constant , such that no cell of the arrangement of is bounded by
hyperplanes of only.
- Every set of points in , for some constant
, contains a subset of cohyperplanar points or points in
general position.
Two-dimensional versions of the above results were respectively proved by
Ackerman et al. [Electronic J. Combinatorics, 2014] and by Payne and Wood [SIAM
J. Discrete Math., 2013].Comment: 8 page
Bisector energy and few distinct distances
We introduce the bisector energy of an -point set in ,
defined as the number of quadruples from such that and
determine the same perpendicular bisector as and . If no line or circle
contains points of , then we prove that the bisector energy is
. We also prove the
lower bound , which matches our upper bound when is
large. We use our upper bound on the bisector energy to obtain two rather
different results:
(i) If determines distinct distances, then for any
, either there exists a line or circle that contains
points of , or there exist
distinct lines that contain points of . This result
provides new information on a conjecture of Erd\H{o}s regarding the structure
of point sets with few distinct distances.
(ii) If no line or circle contains points of , then the number of
distinct perpendicular bisectors determined by is
. This appears to
be the first higher-dimensional example in a framework for studying the
expansion properties of polynomials and rational functions over ,
initiated by Elekes and R\'onyai.Comment: 18 pages, 2 figure
On the structure of pointsets with many collinear triples
It is conjectured that if a finite set of points in the plane contains many
collinear triples then there is some structure in the set. We are going to show
that under some combinatorial conditions such pointsets contain special
configurations of triples, proving a case of Elekes' conjecture. Using the
techniques applied in the proof we show a density version of Jamison's theorem.
If the number of distinct directions between many pairs of points of a pointset
in convex position is small, then many points are on a conic