2000 character limit reached
On the number of ordinary circles
Published 29 Dec 2014 in math.CO and math.MG | (1412.8314v2)
Abstract: We prove that any $n$ points in $\mathbb{R}2$, not all on a line or circle, determine at least $\frac{1}{4}n2-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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.