Mathematics > Combinatorics
[Submitted on 25 Oct 2026 (v1), last revised 19 Nov 2026 (this version, v3)]
Title:Sharp enumeration and growth of admissible sets of integers
View PDF HTML (experimental)Abstract:A set of positive integers is admissible if equal sums of finite subsets always have equal numbers of summands. Let $a(N)$ count the nonempty admissible subsets of $\{1,\ldots,N\}$, and let $b(N)$ count those with maximum $N$. We prove $\log a(N)\sim\log b(N)\sim\pi\sqrt{2N/3}$, establishing the sharp logarithmic asymptotic proposed by Nicolas. More generally, let $Q_h(N)$ count the subsets for which each integer has subset-sum representations of at most $h$ distinct cardinalities. Uniformly for all positive integers $h,N$, we prove $\log Q_h(N)\asymp\min\{N,\sqrt{hN}\}$ with absolute implied constants. Every infinite set satisfying the same condition for some fixed $h$ has counting function $o(\sqrt x)$. At $h=1$, the uniform count proves the conjecture $\log a(N)\asymp\sqrt N$ of Erdős, Nicolas and Sárközy, and the infinite-set theorem strengthens their conjectured vanishing lower limit to a full limit. The proofs record each subset sum together with its cardinality and use the counting theorem of Campos and the structure theorem of Carpenter, Defant and Kravitz. The sharp count also uses Nicolas's partition enumeration and an elementary construction of a long restricted-sum progression. Finally, we give an exact partition formula and asymptotics for the odd sets with separated alternate cardinality layers suggested by Nicolas, and deduce lower bounds for the number of non-stratified admissible sets.
Submission history
From: Wenkai Yang [view email][v1] Sun, 25 Oct 2026 15:26:02 UTC (9 KB)
[v2] Sun, 8 Nov 2026 16:25:16 UTC (21 KB)
[v3] Thu, 19 Nov 2026 13:24:18 UTC (22 KB)
References & Citations
Loading...
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.