Papers
Topics
Authors
Recent
Search
2000 character limit reached

On sets defining few ordinary circles

Published 22 Jul 2016 in math.CO and math.AG | (1607.06597v4)

Abstract: An ordinary circle of a set $P$ of $n$ points in the plane is defined as a circle that contains exactly three points of $P$. We show that if $P$ is not contained in a line or a circle, then $P$ spans at least $\frac{1}{4}n2 - O(n)$ ordinary circles. Moreover, we determine the exact minimum number of ordinary circles for all sufficiently large $n$ and describe all point sets that come close to this minimum. We also consider the circle variant of the orchard problem. We prove that $P$ spans at most $\frac{1}{24}n3 - O(n2)$ circles passing through exactly four points of $P$. Here we determine the exact maximum and the extremal configurations for all sufficiently large $n$. These results are based on the following structure theorem. If $n$ is sufficiently large depending on $K$, and $P$ is a set of $n$ points spanning at most $Kn2$ ordinary circles, then all but $O(K)$ points of $P$ lie on an algebraic curve of degree at most four. Our proofs rely on a recent result of Green and Tao on ordinary lines, combined with circular inversion and some classical results regarding algebraic curves.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.