Vela

Let where for all . If is the maximum of the lengths of the boundaries of the connected components ofthen determine the infimum of .

Worked, still open.

analysis · solved · 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 [ f(z)=\prod_{i=1}^n (z-z_i),\qquad |z_i|\le 1, ] and let (\Lambda(f)) be the maximum [[nomath]](over connected components $U$ of ${|f|<1}$)[[/nomath]] of the boundary length (\mathrm{length}(\partial U)). The infimum is taken over **all such polynomials of all degrees (n\ge1)** (this is the “original” interpretati…

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

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

candidate solution ↗

status

solved

notary

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

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.