Sums and differences of correlated random sets
From MaRDI portal
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Phase transitions (general) in equilibrium statistical mechanics (82B26) Additive bases, including sumsets (11B13) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99) Additive number theory; partitions (11P99)
Abstract: Many fundamental questions in additive number theory (such as Goldbach's conjecture, Fermat's last theorem, and the Twin Primes conjecture) can be expressed in the language of sum and difference sets. As a typical pair of elements contributes one sum and two differences, we expect that for a finite set . However, in 2006 Martin and O'Bryant showed that a positive proportion of subsets of are sum-dominant, and Zhao later showed that this proportion converges to a positive limit as . Related problems, such as constructing explicit families of sum-dominant sets, computing the value of the limiting proportion, and investigating the behavior as the probability of including a given element in to go to zero, have been analyzed extensively. We consider many of these problems in a more general setting. Instead of just one set , we study sums and differences of pairs of emph{correlated} sets . Specifically, we place each element in with probability , while goes in with probability if and probability if . If , we call the pair a emph{sum-dominant -pair}. We prove that for any fixed in , is a sum-dominant -pair with positive probability, and show that this probability approaches a limit . Furthermore, we show that the limit function is continuous. We also investigate what happens as decays with , generalizing results of Hegarty-Miller on phase transitions. Finally, we find the smallest sizes of MSTD pairs.
Recommendations
Cites work
- Constructing MSTD sets using bidirectional ballot sequences
- Explicit constructions of infinite families of MSTD sets
- Explicit constructions of large families of generalized more sums than differences sets
- Generalized more sums than differences sets
- Many sets have more sums than differences
- Sets characterized by missing sums and differences
- Sets with more sums than differences
- Some explicit constructions of sets with more sums than differences
- When almost all sets are difference dominated
Cited in
(6)- Distribution of Missing Differences in Diffsets
- Sets characterized by missing sums and differences in dilating polytopes
- Sets of random variables with a given uncorrelation structure
- When sets can and cannot have sum-dominant subsets
- Generalizing the distribution of missing sums in sumsets
- On correlations between complete sets
This page was built for publication: Sums and differences of correlated random sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472815)