Vela

Find, for all large , a non-trivial pairwise balanced block design such that, for all , there are many such that .

Worked, still open.

combinatorics · open · possible · 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

Fix a large $n$ and write [ k:=\left\lceil \sqrt n\right\rceil,\qquad K:={k,k+1,\dots,2k-1}. ]

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

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

candidate solution ↗

status

open

notary

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

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.