Vela

Let be maximal such that in any with there exists some sum-free subset with , so that there are no solutions towith . Estimate .

Worked, still open.

additive 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

[ f(n):=\min_{\substack{A\subset\mathbb Z\ |A|=n}}\ \max{|B|:B\subseteq A,\ B\ \text{sum-free}}, ]

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 11da8815050cb3137d57d8a27337006d48c9346d26a53a5c78c5f4d1ab4a2a74

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.