Vela

erdős #669 · orchard problems

← #668 · #670 (packet.json; erdosproblems.com)

Let be minimal such that for any points in there exist at most many distinct lines passing through at least of the points, and similarly but with lines passing through exactly points.Estimate and - in particular, determine and .

Worked, still open.

geometry · open · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Let (P\subset \mathbb R^2) with (|P|=n). Write [ t_j(P):=|\\{\text{lines }\ell:\ |\ell\cap P|=j\\}|,\qquad T_k(P):=|\\{\text{lines }\ell:\ |\ell\cap P|\ge k\\}|=\sum_{j\ge k} t_j(P). ] Then your extremal functions are [ f_k(n)=\max_{|P|=n} t_k(P),\qquad F_k(n)=\max_{|P|=n} T_k(P)=\max_{|P|=n}\sum_{j\ge k} t_j(P). ]

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

candidate solution ↗

oeis

status

open

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 a7524c63710e189c4544a794d038fe5c1f87a42e06a35517f43ad0908dfef836

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.