ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a set of nn points in the Euclidean plane, and let ckc_k denote the maximum number of circles containing at least kk points of PP. Point-circle incidence bound conjecture. For every ε>0\varepsilon>0 and k>nεk>n^\varepsilon,

ck=O(n2k−3+nk−1).c_k=O(n^2k^{-3}+nk^{-1}).

The paper states that this bound, together with the conjectured bisector-energy estimate, would yield nearly tight bounds for its distinct-bisector and pinned-distance theorems.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.