pith. sign in

arxiv: 1412.8314 · v2 · pith:L4A7UKJDnew · submitted 2014-12-29 · 🧮 math.CO · math.MG

On the number of ordinary circles

classification 🧮 math.CO math.MG
keywords circlesordinarypointsbestboundcirclecontainingdetermine
0
0 comments X
read the original abstract

We prove that any $n$ points in $\mathbb{R}^2$, not all on a line or circle, determine at least $\frac{1}{4}n^2-O(n)$ ordinary circles (circles containing exactly three of the $n$ points). The main term of this bound is best possible for even $n$. Our proof relies on a recent result of Green and Tao on ordinary lines.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.