Fringe pairs in generalized MSTD sets

Abstract: A More Sums Than Differences (MSTD) set is a set

A

for which

| A + A | > | A - A |

. Martin and O'Bryant proved that the proportion of MSTD sets in

0, 1, d o t s, n

is bounded below by a positive number as

n

goes to infinity. Iyer, Lazarev, Miller and Zhang introduced the notion of a generalized MSTD set, a set

A

for which

| s A - d A | > | s i g m a A - d e l t a A |

for a prescribed

s + d = s i g m a + d e l t a

. We offer efficient constructions of

k

-generational MSTD sets, sets

A

where

A, A + A, d o t s, k A

are all MSTD. We also offer an alternative proof that the proportion of sets

A

for which

| s A - d A | - | s i g m a A - d e l t a A | = x

is positive, for any

x i n m a t h b b Z

. We prove that for any

e p s i l o n > 0

,

P r (1 - e p s i l o n < l o g | s A - d A | / l o g | s i g m a A - d e l t a A | < 1 + e p s i l o n)

goes to

1

as the size of

A

goes to infinity and we give a set

A

which has the current highest value of

l o g | A + A | / l o g | A - A |

. We also study decompositions of intervals

0, 1, d o t s, n

into MSTD sets and prove that a positive proportion of decompositions into two sets have the property that both sets are MSTD.

Cites Work

Cited In (5)

This page was built for publication: Fringe pairs in generalized MSTD sets