Erdős–Nicolas–Sárközy conjecture on admissible subsets
For a finite set , call admissible if for all subsets , implies . Let be the number of nonempty admissible subsets of . The Erdős–Nicolas–Sárközy conjecture asserts that as ; equivalently, there exist absolute constants and an integer such that for all .
References
- Counting Admissible Sets of Integers: A Proof of the Erdős--Nicolas--Sárközy Conjecture — arXiv — Guoqing Wang, Wenkai Yang
Source: arXiv
Progress summary
An unrefereed October preprint claims to prove the conjecture’s predicted logarithmic growth law, but no independent assessment was found.
The Erdős–Nicolas–Sárközy conjecture predicts logarithmic growth for the number of admissible subsets. The problem has been open for roughly three decades.
October 2026 claimed proof
Guoqing Wang and Wenkai Yang claim that their preprint proves the conjectured logarithmic bounds, using a structural doubling argument for the upper bound. They also claim analogous results when admissible sets are counted by their maximum. The preprint is unrefereed, and no independent mathematical assessment was retrieved.
Current status (as of October 2026): A preprint claims the conjecture is solved, but the claim remains unverified; no independently assessed proof or contrary result was found.
Sources
Solutions 0
No solutions have been posted yet.