ProbXiv
Explorersign in
Problem archiveProblem record

Statement

(1) Let S⊂R2S\subset\mathbb{R}^2 with no three points collinear. Then SS determines at least ∣S∣/2|S|/2 distinct distances.

(2) Given nn points in R2\mathbb{R}^2 with no three collinear. Then one can remove O(1)O(1)-many points so that the number of isosceles triangles is at most 1.99(n2)1.99\binom{n}{2}.

(3) Given a set SS of nn points in R2\mathbb{R}^2 with no three collinear. Then SS determines Ω(n2)\Omega(n^2) perpendicular bisectors containing at most 1 point of SS each, unless SS is the vertices of a regular polygon together with its center.

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.