frontiers / 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

used by 1 · replayed by 1 producer · second seat open

e33/33 · finding.asserted · reviewer:will · 2026-06-03 · null→e123

Source record

back to sources

Freiman 1973 / Ruzsa 1994

id: vs_96f15c07c79678ba
frontier: Additive combinatorics: Sidon sets and N(h,k) bounds
type: paper

source boundary

frontier-owned

declared

finding bindings

record context

1 findings

evidence atoms

materialized

1 atoms

review context

inspectable

1 events

1 reviewable changes and 0 evaluations are attached through this source or its findings.

citation

locator

title:Freiman 1973 / Ruzsa 1994

imported

2026-05-09T22:52:52.494889+00:00

extraction mode

manual_curation

authors

agent:research-bot-2026-05-09

caveats

No caveats recorded.

Bound findings

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|.
theoretical · vf_5a1d047a8c85953a

Evidence atoms

vea_2ccdfb693083935ctheoretical · unknown
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|.

Review, event, and evaluation records

events

vev_1e6cffe8f7c7d6c8finding.asserted
Manual finding added to frontier state
agent:research-bot-2026-05-09 · 2026-05-09

reviewable changes

vpr_05864abc06a6a424finding.add
Manual finding added to frontier state
applied · agent:research-bot-2026-05-09 · 2026-05-09

evaluations

No evaluation rows are attached.