Generalizing the distribution of missing sums in sumsets

Abstract: Given a finite set of integers

A

, its sumset is

A + A := a_{i} + a_{j} m i d a_{i}, a_{j} i n A

. We examine

| A + A |

as a random variable, where

A s u b s e t I_{n} = [0, n - 1]

, the set of integers from 0 to

n - 1

, so that each element of

I_{n}

is in

A

with a fixed probability

p i n (0, 1)

. Recently, Martin and O'Bryant studied the case in which

p = 1 / 2

and found a closed form for

m a t h b b E [| A + A |]

. Lazarev, Miller, and O'Bryant extended the result to find a numerical estimate for

e x t V a r (| A + A |)

and bounds on the number of missing sums in

A + A

,

m_{n,;, p} (k) := m a t h b b P (2 n - 1 - | A + A | = k)

. Their primary tool was a graph-theoretic framework which we now generalize to provide a closed form for

m a t h b b E [| A + A |]

and

e x t V a r (| A + A |)

for all

p i n (0, 1)

and establish good bounds for

m a t h b b E [| A + A |]

and

m_{n,;, p} (k)

. We continue to investigate

m_{n,;, p} (k)

by studying

m_{p} (k) = l i m_{n o i n f t y} m_{n,;, p} (k)

, proven to exist by Zhao. Lazarev, Miller, and O'Bryant proved that, for

p = 1 / 2

,

m_{1 / 2} (6) > m_{1 / 2} (7) < m_{1 / 2} (8)

. This distribution is not unimodal, and is said to have a "divot" at 7. We report results investigating this divot as

p

varies, and through both theoretical and numerical analysis, prove that for

p g e q 0.68

there is a divot at

1

; that is,

m_{p} (0) > m_{p} (1) < m_{p} (2)

. Finally, we extend the graph-theoretic framework originally introduced by Lazarev, Miller, and O'Bryant to correlated sumsets

A + B

where

B

is correlated to

A

by the probabilities

m a t h b b P (i i n B m i d i i n A) = p_{1}

and

m a t h b b P (i i n B m i d i o t i n A) = p_{2}

. We provide some preliminary results using the extension of this framework.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Generalizing the distribution of missing sums in sumsets