Vela

Let be an infinite set such that, for any , there are most solutions to with . Must

Open — best to date is a honest null, not yet sealed.

sidon sets · open · formalized (Lean) · 1 attempt

machinery: Sidon/B_h,additive-combinatorics,B2[g]-representation-counting,second-moment-bound,counting-density-liminf

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

honest null

needs verification

attempted via frontier 'sidon/B2' (transfer_strength=weak) -> no_progress

No solve/partial on this pass. Transfer into the owned frontier was 'weak'. Do not re-attack cold; needs a new idea or richer accumulated context.

unverified AI candidates (2)

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

Your hypothesis is exactly that (A) is an **infinite (B_2[2]) set**: every integer (n) has at most (2) (unordered) representations (n=a+b) with (a\le b), (a,b\in A).

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

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

candidate solution ↗

formal

AMS 5 · api, ams 5, simp (literature)

lemma b2_one {A : Set ℕ} : B2 1 A ↔ IsSidon A where
  mp hA a₁ ha₁ a₂ ha₂ b₁ hb₁ b₂ hb₂ h
formal-conjectures/158.lean ↗

Vela Sidon frontier (A309370) · verified work

A B₂/Sidon problem — the same object family as Vela's verified Sidon records, where nine improved terms were accepted into OEIS A309370 (the campaign's first external adoption).

OEIS A309370 ↗ · verified-combinatorics (witnesses + verify.py) ↗ · the Erdős campaign

status

open

notary

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

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.