evidence boundary
unknownfrontiers / frontier
Additive combinatorics: Sidon sets and N(h,k) bounds
- id
- vfr_496956067dc5ad79
- license
- CC-BY-4.0
- findings
- 22
- accepted core
- 1
- contested
- 1
- links
- 0
- sources
- 22
- evidence
- 22
- avg conf
- 0.83
e33/33 · finding.asserted · reviewer:will · 2026-06-03 · null→e123
Evidence atom
back to sourcesA Sidon set in {1,...,N} of size O(sqrt(N)) exists, attaining the elementary upper bound for h=2 sumsets up to a multiplicative constant.
- id
- vea_30334dad5d113f8e
- frontier
- Additive combinatorics: Sidon sets and N(h,k) bounds
- source
- vs_dad56783e2506cf1
- finding
- vf_63f4bcd4f4904a08
finding binding
boundtheoretical
A Sidon set in {1,...,N} of size O(sqrt(N)) exists, attaining the elementary upper bound for h=2 sumsets up to a multiplicative constant.
source binding
source-boundErdos-Turan, 1941
vs_dad56783e2506cf1
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
A Sidon set in {1,...,N} of size O(sqrt(N)) exists, attaining the elementary upper bound for h=2 sumsets up to a multiplicative constant.
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_dbace8b360cec0eb
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_96a3ee14236bfe3ffinding.assertedManual finding added to frontier state
agent:research-bot-2026-05-09 · 2026-05-09
reviewable changes
vpr_0278b354889109bbfinding.addManual finding added to frontier state
applied · agent:research-bot-2026-05-09 · 2026-05-09
evaluations
No evaluation rows are attached.