WorksMathematics
An Explicit Construction of Large Families of MSTD Sets
Abstract
A finite set is more sums than differences (MSTD) if . Yufei Zhao's bidirectional-ballot construction gives MSTD subsets of , the best previously known size bound for an explicit family, to the author's knowledge. We improve this bound: for every fixed integer , we construct a family of MSTD subsets, where denotes the -fold iterated logarithm. This family is asymptotically larger than Zhao's for every fixed . A subfamily of the same order of magnitude can be numbered so that any chosen member can be generated deterministically in time polynomial in , 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.