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 sourcesLindstrom'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).
- id
- vea_f6b6aca975df9d45
- frontier
- Additive combinatorics: Sidon sets and N(h,k) bounds
- source
- vs_5e7234813199a87e
- finding
- vf_f58c1d68daec29c3
finding binding
boundtheoretical
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).
source binding
source-boundLindstrom 1969
vs_5e7234813199a87e
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
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).
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_0f9a03e46b856fef
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_c69adcc670609f4ffinding.assertedManual finding added to frontier state
agent:research-bot-2026-05-09 · 2026-05-09
reviewable changes
vpr_e39490231271928afinding.addManual finding added to frontier state
applied · agent:research-bot-2026-05-09 · 2026-05-09
evaluations
No evaluation rows are attached.