Large Sidon Subsets and Pair-Sum Multiplicities of Distinct Multinomial Coefficients

Felix Huber

Abstract

For a positive integer $n$, let $\mathcal{M}_n$ be the set of distinct multinomial coefficient values $n!/(p_1!\cdots p_t!)$, where $(p_1,\ldots,p_t)$ ranges over the integer partitions of $n$. We study two complementary aspects of the additive structure of $\mathcal{M}_n$: the maximum cardinality $s(n)$ of a Sidon subset and the multiplicities of unordered pair sums in the full set. A product embedding, strongly Sidon subsets, and estimates for prime partitions give \[ \liminf_{n\to\infty}\frac{\log(s(n)/n)\log\log n}{\sqrt{\log n}}\geq\fracπ{\sqrt{3}}. \] Long arithmetic progressions and separated copies yield a complementary lower bound $2/(3\sqrt{3})$ for the normalized Sidon defect. Writing $r_n(t)$ for the number of unordered representations $t=x+y$ with $x,y\in\mathcal{M}_n$, we study the collision excess $C(n)$, the number $D(n)$ of multiply represented sums, the maximum multiplicity $μ(n)$, and the cumulative profile $T(n,k)$. We prove \[ \liminf\frac{C(n)}{n^2\log n}\geq\frac18,\qquad \liminf\frac{D(n)}{n^{3/2}\sqrt{\log n}}\geq\frac{4}{3\sqrt{3}},\qquad \liminf\frac{μ(n)}{\sqrt{n\log n}}\geq\frac12. \] We also obtain a scaled lower envelope for the full profile, an additive-energy bound, stabilization with respect to the number of variables, and an explicit family of trinomial collisions. Exact Sidon values through $n=16$, the lower bound $s(17)\geq89$, and pair-sum statistics through $n=20$ are reported with reproducible computational material.

Disclosure

“15 AI-assisted research disclosure The mathematical exploration and preparation of this manuscript were carried out with substantial assistance from OpenAI’s ChatGPT, principally GPT-5.6 Thinking, during July and August 2026. The system was used interactively to explore conjectures and generalizations, propose definitions and intermediate claims, develop and revise proof arguments, identify possible ga”

PDF page 23
Classification
Proof ideas or individual proof-step assistance
Multiplier
8
Verified

Structural counts

Pages 24 pdf
Theorems 6 source
Lemmas 10 source
Propositions 14 source
Corollaries 7 source
Definitions 1 source
Displayed equations 177 source
Bibliography entries 9 source
Appendix pages 0 estimated

Count notes

  • Source counts use the expanded primary TeX file main.tex.
  • Appendix pages include the first PDF page with an explicit Appendix heading through the final page.