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

Erdos-Turan, 1941

id: vs_dad56783e2506cf1
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:Erdos-Turan, 1941

imported

2026-05-09T19:20:20.711546+00:00

extraction mode

manual_curation

authors

agent:research-bot-2026-05-09

caveats

No caveats recorded.

Bound findings

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

Evidence atoms

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

Review, event, and evaluation records

events

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

reviewable changes

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

evaluations

No evaluation rows are attached.