Add to ORKGFor every set of integers R = {x1,..., xr}, there is a corresponding sumset with all pairwise sums R+R: = {xi + xj: 1 ≤ i, j ≤ r} (1) and a difference set with all possible pairwise differences R−R: = {xi − xj: 1 ≤ i, j ≤ r}. (2
The limiting distributions in two partition problems are derived in closed form and related to known...
AbstractWe give a comparison inequality that allows one to estimate the tail probabilities of sums o...
summary:Let $M$ be a given nonempty set of positive integers and $S$ any set of nonnegative integers...
For any finite set of integers X, define its sumset X + X to be {x + y: x, y ∈ X}. In a recent paper...
A more sums than differences (MSTD) set is a finite subset S of the integers such |S + S |> |S − ...
In the paper, we consider a new approach to the comparison of the distributions of sums of random va...
AbstractA classic result in probability theory states that two independent real-valued random variab...
We present new counterexamples, which provide stronger limitations to sums-differences statements th...
We show that a random set of integers with density 0 has almost always more differences than sums
We show that a random set of integers with density 0 has almost always more differences than sums
ABSTRACT. A sum-dominant set is a finite set A of integers such that |A + A |> |A − A|. As a typi...
Let {ξ1, ξ2, . . .} be a sequence of independent random variables, and η be a counting random variab...
ABSTRACT. A More Sums Than Differences (MSTD) set is a set of integers A ⊂ {0,..., n − 1} whose sums...
AbstractThis paper deals with the problem of finding the maximal density μ(M) of sets of integers in...
AbstractFor a given set M of positive integers, a problem of Motzkin asks for determining the maxima...
The limiting distributions in two partition problems are derived in closed form and related to known...
AbstractWe give a comparison inequality that allows one to estimate the tail probabilities of sums o...
summary:Let $M$ be a given nonempty set of positive integers and $S$ any set of nonnegative integers...
For any finite set of integers X, define its sumset X + X to be {x + y: x, y ∈ X}. In a recent paper...
A more sums than differences (MSTD) set is a finite subset S of the integers such |S + S |> |S − ...
In the paper, we consider a new approach to the comparison of the distributions of sums of random va...
AbstractA classic result in probability theory states that two independent real-valued random variab...
We present new counterexamples, which provide stronger limitations to sums-differences statements th...
We show that a random set of integers with density 0 has almost always more differences than sums
We show that a random set of integers with density 0 has almost always more differences than sums
ABSTRACT. A sum-dominant set is a finite set A of integers such that |A + A |> |A − A|. As a typi...
Let {ξ1, ξ2, . . .} be a sequence of independent random variables, and η be a counting random variab...
ABSTRACT. A More Sums Than Differences (MSTD) set is a set of integers A ⊂ {0,..., n − 1} whose sums...
AbstractThis paper deals with the problem of finding the maximal density μ(M) of sets of integers in...
AbstractFor a given set M of positive integers, a problem of Motzkin asks for determining the maxima...
The limiting distributions in two partition problems are derived in closed form and related to known...
AbstractWe give a comparison inequality that allows one to estimate the tail probabilities of sums o...
summary:Let $M$ be a given nonempty set of positive integers and $S$ any set of nonnegative integers...