betaFeedback

WorksMathematics

An Explicit Construction of Large Families of MSTD Sets

Abstract

A finite set S⊂ZS\subset\mathbb Z is more sums than differences (MSTD) if ∣S+S∣>∣S−S∣|S+S|>|S-S|. Yufei Zhao's bidirectional-ballot construction gives Θ(2N/N)Θ(2^N/N) MSTD subsets of [0,N−1][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≥1T\geq1, we construct a family of ΘT(2N/(log⁡2∘TN)2T)Θ_T(2^N/(\log_2^{\circ T} N)^{2^T}) MSTD subsets, where log⁡2∘T\log_2^{\circ T} denotes the TT-fold iterated logarithm. This family is asymptotically larger than Zhao's for every fixed T≥1T\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 NN, 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.

Paper details

vlnc:W_4yyfdjan
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 8

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT (OpenAI), Aristotle AI

View statement
Looking for related papers…