Sidon set density inside (4,5) sets ()
Sidon set density inside (4,5) sets: determine 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.
Problem statement
is the largest constant such that every -set of size (i.e., a set of reals such that every four-element subset determines at least five distinct differences) contains a Sidon set of cardinality .
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
- Determining is Erdős problem #757.
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 |
|---|---|---|
| Trivial | ||
| [GL95] | ||
| [MT26] |
Known lower bounds
| Bound | Reference | Comments |
|---|---|---|
| [GL95] | A short 2-colorability argument | |
| [GL95] | ||
| [MT26] |
- [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 recordedAttempts 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 notesNotes 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.