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 sourcesBehrend's construction yields subsets of {1,...,N} of size N * exp(-c * sqrt(log N)) containing no nontrivial 3-term arithmetic progression, the densest such known until 2020.
- id
- vea_92db9ae1d5af39f4
- frontier
- Additive combinatorics: Sidon sets and N(h,k) bounds
- source
- vs_50a4cd210cbedc58
- finding
- vf_11e2e2a19e75887d
finding binding
boundtheoretical
Behrend's construction yields subsets of {1,...,N} of size N * exp(-c * sqrt(log N)) containing no nontrivial 3-term arithmetic progression, the densest such known until 2020.
source binding
source-boundBehrend 1946
vs_50a4cd210cbedc58
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
Behrend's construction yields subsets of {1,...,N} of size N * exp(-c * sqrt(log N)) containing no nontrivial 3-term arithmetic progression, the densest such known until 2020.
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_b60a8fa02a53e120
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_49d1b9096fd11088finding.assertedManual finding added to frontier state
agent:research-bot-2026-05-09 · 2026-05-09
reviewable changes
vpr_e8f2d600cbebd03dfinding.addManual finding added to frontier state
applied · agent:research-bot-2026-05-09 · 2026-05-09
evaluations
No evaluation rows are attached.