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 sourcesSanders' bound: density alpha > C * (log log N)^4 / log N is sufficient to guarantee a 3-term AP in any subset of {1,...,N}.
- id
- vea_d329d7aab20b623d
- frontier
- Additive combinatorics: Sidon sets and N(h,k) bounds
- source
- vs_09e905c736db9a3d
- finding
- vf_e2252a5f8d8a5049
finding binding
boundtheoretical
Sanders' bound: density alpha > C * (log log N)^4 / log N is sufficient to guarantee a 3-term AP in any subset of {1,...,N}.
source binding
source-boundSanders 2011
vs_09e905c736db9a3d
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
Sanders' bound: density alpha > C * (log log N)^4 / log N is sufficient to guarantee a 3-term AP in any subset of {1,...,N}.
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_5858437ec952238c
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_5556d3110ede8413finding.assertedManual finding added to frontier state
agent:research-bot-2026-05-09 · 2026-05-09
reviewable changes
vpr_3ff7da5280e3bb36finding.addManual finding added to frontier state
applied · agent:research-bot-2026-05-09 · 2026-05-09
evaluations
No evaluation rows are attached.