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 sourcesFreiman's theorem: a finite set A of integers with |A+A| <= K|A| is contained in a generalized arithmetic progression of dimension at most d(K) and size at most f(K) * |A|.
- id
- vea_2ccdfb693083935c
- frontier
- Additive combinatorics: Sidon sets and N(h,k) bounds
- source
- vs_96f15c07c79678ba
- finding
- vf_5a1d047a8c85953a
finding binding
boundtheoretical
Freiman's theorem: a finite set A of integers with |A+A| <= K|A| is contained in a generalized arithmetic progression of dimension at most d(K) and size at most f(K) * |A|.
source binding
source-boundFreiman 1973 / Ruzsa 1994
vs_96f15c07c79678ba
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
Freiman's theorem: a finite set A of integers with |A+A| <= K|A| is contained in a generalized arithmetic progression of dimension at most d(K) and size at most f(K) * |A|.
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_5cd4524daec0751c
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_1e6cffe8f7c7d6c8finding.assertedManual finding added to frontier state
agent:research-bot-2026-05-09 · 2026-05-09
reviewable changes
vpr_05864abc06a6a424finding.addManual finding added to frontier state
applied · agent:research-bot-2026-05-09 · 2026-05-09
evaluations
No evaluation rows are attached.