Constructing MSTD Sets Using Bidirectional Ballot Sequences

Details Constructing MSTD Sets Using Bidirectional Ballot Sequences Constructing MSTD Sets Using Bidirectional Ballot Sequences

2009-08-31

arxiv.org/abs/0908.4442v1

Journal of Number Theory, Volume 130, Issue 5, May 2010, Pages 1212-1220

Mathematics

Combinatorics

9 pages, 2 tables, 5 figures

Scientific paper

10.1016/j.jnt.2009.11.005

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.

Affiliated with

Also associated with

No associations

Rating

Constructing MSTD Sets Using Bidirectional Ballot Sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constructing MSTD Sets Using Bidirectional Ballot Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructing MSTD Sets Using Bidirectional Ballot Sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-220087