Vela

If is a Sidon set then must the complement of contain an infinite arithmetic progression?

Worked, still open.

additive combinatorics · solved · formalized (Lean) · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

formal

AMS 5 · solved (literature)

lemma baumgartner_strong (V : Type*) [AddCommGroup V] [Module ℚ V] (k : ℕ) :
    ∃ X : Set V,
      (∀ Y, Y.IsAPOfLength ⊤ → (X ∩ Y).Nonempty) ∧
      (∀ Y, IsAPOfLength Y k → (X ∩ Y).ncard ≤ 2)
formal-conjectures/198.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

solved

notary

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

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.