Generalizing the Distribution of Missing Sums in Sumsets
arXiv:2005.07981
Abstract
Given a finite set of integers , its sumset is . We examine as a random variable, where , the set of integers from 0 to , so that each element of is in with a fixed probability . Recently, Martin and O'Bryant studied the case in which and found a closed form for . Lazarev, Miller, and O'Bryant extended the result to find a numerical estimate for and bounds on the number of missing sums in , . Their primary tool was a graph-theoretic framework which we now generalize to provide a closed form for and for all and establish good bounds for and . We continue to investigate by studying , proven to exist by Zhao. Lazarev, Miller, and O'Bryant proved that, for , . This distribution is not unimodal, and is said to have a "divot" at 7. We report results investigating this divot as varies, and through both theoretical and numerical analysis, prove that for there is a divot at ; that is, . Finally, we extend the graph-theoretic framework originally introduced by Lazarev, Miller, and O'Bryant to correlated sumsets where is correlated to by the probabilities and . We provide some preliminary results using the extension of this framework.
Version 1.0, 35 pages, 14 figures
References in corpus (6)
- Constructing MSTD Sets Using Bidirectional Ballot Sequences
- Sets Characterized by Missing Sums and Differences
- When Sets Can and Cannot Have MSTD Subsets
- Generalizations of a Curious Family of MSTD Sets Hidden By Interior Blocks
- Distribution of missing differences in diffsets
- Coordinate sum and difference sets of -dimensional modular hyperbolas