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 sourcesFor h>=3 the analog of N(h,k) admits a polynomial in k upper bound via h-squared-dissociated sets, replacing the prior exponential construction.
- id
- vea_ac42cdef8d22e70b
- frontier
- Additive combinatorics: Sidon sets and N(h,k) bounds
- source
- vs_1d22325daa3fcda7
- finding
- vf_0baa77910460c953
finding binding
boundtheoretical
For h>=3 the analog of N(h,k) admits a polynomial in k upper bound via h-squared-dissociated sets, replacing the prior exponential construction.
source binding
source-boundNathanson, 2024 (open problem)
vs_1d22325daa3fcda7
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
For h>=3 the analog of N(h,k) admits a polynomial in k upper bound via h-squared-dissociated sets, replacing the prior exponential construction.
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_3576f22170084a6a
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_d2cd7a944b937b0cfinding.assertedManual finding added to frontier state
agent:research-bot-2026-05-09 · 2026-05-09
reviewable changes
vpr_d4460bfc4377511dfinding.addManual finding added to frontier state
applied · agent:research-bot-2026-05-09 · 2026-05-09
evaluations
No evaluation rows are attached.