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

Nathanson, 2024 (open problem)

id: vs_1d22325daa3fcda7
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:Nathanson, 2024 (open problem)

imported

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

extraction mode

manual_curation

authors

agent:research-bot-2026-05-09

caveats

No caveats recorded.

Bound findings

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

Evidence atoms

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

Review, event, and evaluation records

events

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

reviewable changes

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

evaluations

No evaluation rows are attached.