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 sourcesSzemeredi's theorem: any subset of the natural numbers with positive upper density contains arbitrarily long arithmetic progressions.
- id
- vea_3d6fbbc6d03cf374
- frontier
- Additive combinatorics: Sidon sets and N(h,k) bounds
- source
- vs_ef43a01cb50e4311
- finding
- vf_a4c54b1f9ff55bba
finding binding
boundtheoretical
Szemeredi's theorem: any subset of the natural numbers with positive upper density contains arbitrarily long arithmetic progressions.
source binding
source-boundSzemeredi 1975
vs_ef43a01cb50e4311
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
Szemeredi's theorem: any subset of the natural numbers with positive upper density contains arbitrarily long arithmetic progressions.
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_fd462fe4767afe90
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_44682f49ec697b30finding.assertedManual finding added to frontier state
agent:research-bot-2026-05-09 · 2026-05-09
reviewable changes
vpr_aa438fc28809dfb1finding.addManual finding added to frontier state
applied · agent:research-bot-2026-05-09 · 2026-05-09
evaluations
No evaluation rows are attached.