Let $A_{1} (N)$ be the number of maximal Sidon subsets of ${1, \dots, N}$ . Is it true that $A_{1} (N) < 2^{o (N^{1/2})} ?$ Is it true that $A_{1} (N) > 2^{N^{c}}$ for some constant $c > 0$ ?

Worked, still open.

number theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

oeis

A382395 — Number of maximum sized subsets of {1..n} such that every pair of distinct elements has a different difference.1,1,1,3,2,6,14,2,10,26,60,110,4,22,68,156,320,584,8,24,80,206,504,1004,1910,3380,10,34,98,282,760,1618,3334,6360,11482,2

links

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

Create a formalisation here · link

status

solved

oeis

links

status

Search Vela