OpenFrontiers
← Back to the index
OP-12002OpenNumber theory

Sidon set density inside (4,5) sets (C5bC_{5b})

Sidon set density inside (4,5) sets: determine C5bC_{5b} or improve its bounds; the repository records 0.5294 (lower) and 0.5714 (upper).

Editorial MSC2020 classification. Original article codes and source evidence are recorded in the literature directory.

Licensed source statementAs of Repository table at commit 2c1968c (2026-09-26); open while the recorded lower and upper bounds differSource & evidence ↓

Problem statement

C5bC_{5b} is the largest constant such that every (4,5)(4,5)-set of size nn (i.e., a set of reals such that every four-element subset determines at least five distinct differences) contains a Sidon set of cardinality C5bnC_{5b}n.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

References (from the repository page)

  • [GL95] A. Gyárfás and J. Lehel, Linear sets with five distinct differences among any four elements, J. Combin. Theory Ser. B 64 (1995), 108–118.
  • [MT26] Jie Ma and Quanyu Tang, Largest Sidon subsets in weak Sidon sets. arXiv:2602.23282 (2026).

Progress & source assessment

Repository table (commit 2c1968c, 26 September 2026): best known lower bound 0.5294; best known upper bound 0.5714. Values marked with an asterisk have minimal verification.

Known upper bounds

Bound Reference Comments
11 Trivial
35=0.6\frac{3}{5} = 0.6 [GL95]
47≈0.5714\frac{4}{7} \approx 0.5714 [MT26]

Known lower bounds

Bound Reference Comments
12\frac{1}{2} [GL95] A short 2-colorability argument
12+1141×76≈0.500093\frac{1}{2} + \frac{1}{141 \times 76} \approx 0.500093 [GL95]
917≈0.5294\frac{9}{17} \approx 0.5294 [MT26]
References
  1. [1]Davis, Damek; Ivanisvili, Paata; Tao, Terence (maintainers). Optimization Constants in Mathematics, github.com/teorth/optimizationproblems (commit 2c1968c, 26 September 2026). — Sidon set density inside (4,5) sets ($C_{5b}$) linkApache-2.0 (repository license); constant pages reproduced with attribution; repository references retained.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.