Constructing MSTD Sets Using Bidirectional Ballot Sequences
Combinatorics
2015-10-26 v1 Number Theory
Abstract
A more sums than differences (MSTD) set is a finite subset S of the integers such that |S+S| > |S-S|. We construct a new dense family of MSTD subsets of {0, 1, 2, ..., n-1}. Our construction gives Theta(2^n/n) MSTD sets, improving the previous best construction with Omega(2^n/n^4) MSTD sets by Miller, Orosz, and Scheinerman.
Cite
@article{arxiv.0908.4442,
title = {Constructing MSTD Sets Using Bidirectional Ballot Sequences},
author = {Yufei Zhao},
journal= {arXiv preprint arXiv:0908.4442},
year = {2015}
}
Comments
9 pages, 2 tables, 5 figures