← ALB News · curated headline

An Explicit Construction of Large Families of MSTD Sets

arXiv Mathematics · WORLD · Mathematics · 11/19/2026, 12:00:00 AM

arXiv:2611.23338v1 Announce Type: new Abstract: A finite set $S\subset\mathbb Z$ is more sums than differences (MSTD) if $|S+S|>|S-S|$. Yufei Zhao's bidirectional-ballot construction gives $\Theta(2^N/N)$ MSTD subsets of $[0,N-1]$, the best previously known size bound for an explicit family, to the author's knowledge. We improve this bound: for every fixed integer $T\geq1$, we construct a family of $\Theta_T(2^N/(\log_2^{\circ T} N)^{2^T})$ MSTD subsets, where $\log_2^{\circ T}$ denotes the $T$-fold iterated logarithm. This family is asymptotically larger than Zhao's for every fixed $T\geq1$. A subfamily of the same order of magnitude can be numbered so that any chosen member can be generated deterministically in time polynomial in $N$, without listing preceding members. As a supplementary comparison, replacing the terminal ballot rule by exhaustive fringe search gives a positive-proportion family with the same polynomial-time generation property.

Continue to arXiv Mathematics →

You are being forwarded in 6s — stay on this page