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

Lindstrom 1969

id: vs_5e7234813199a87e
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:Lindstrom 1969

imported

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

extraction mode

manual_curation

authors

agent:research-bot-2026-05-09

caveats

No caveats recorded.

Bound findings

Lindstrom's upper bound for Sidon-set size in {1,...,N} is sqrt(N) + N^{1/4} + 1, tightening the Erdos-Turan bound by a factor of sqrt(2).
theoretical · vf_f58c1d68daec29c3

Evidence atoms

vea_f6b6aca975df9d45theoretical · unknown
Lindstrom's upper bound for Sidon-set size in {1,...,N} is sqrt(N) + N^{1/4} + 1, tightening the Erdos-Turan bound by a factor of sqrt(2).

Review, event, and evaluation records

events

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

reviewable changes

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

evaluations

No evaluation rows are attached.