Add to ORKGAbstract. The aim of this paper is to prove a general version of Plünnecke’s inequal-ity. Namely, assume that for finite sets A, B1,... Bk we have information on the size of the sumsets A + Bi1 + · · · + Bil for all choices of indices i1,... il. Then we prove the existence of a non-empty subset X of A such that we have ‘good control ’ over the size of the sumset X + B1 + · · · + Bk. As an application of this result we generalize an inequality of [1] concerning the submultiplicativity of cardinalities of sumsets. 1
AbstractWe give tight lower bounds on the cardinality of the sumset of two finite, nonempty subsets ...
AbstractFor finite non-empty sets of integers A and B put A+̂B=}a+b: a∈A,b∈B,a≠b{. In this paper, we...
AbstractIn this paper we determine the bounds of using two analytical algorithms for the subset-sum ...
We determine the sharp lower bound for the cardinality of the restricted sumset A+0B = fa + b j a 2 ...
We determine the sharp lower bound for the cardinality of the restricted sumset A+' B = {a + b | a ∈...
AbstractWe determine explicitly the least possible size of the sumset of two subsetsA, B⊂(Z/pZ)Nwith...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractIn this paper we determine the bounds of using two analytical algorithms for the subset-sum ...
The main objective of this thesis is to present and prove Plünnecke's Inequality, a theorem that giv...
We study the relationship between the number of minus signs in a generalized sumset, A+ · · ·+A − ...
AbstractLet A be a set of nonnegative integers. For h≥2, denote by hA the set of all the integers re...
We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmer...
Let A be a subset of a ring with cardinality |A | = N. The sum set and the product set are 2A = A+A...
We give a new proof of a sumset conjecture of Furstenberg that was rst proved by Hochman and Shmerki...
AbstractWe give tight lower bounds on the cardinality of the sumset of two finite, nonempty subsets ...
AbstractFor finite non-empty sets of integers A and B put A+̂B=}a+b: a∈A,b∈B,a≠b{. In this paper, we...
AbstractIn this paper we determine the bounds of using two analytical algorithms for the subset-sum ...
We determine the sharp lower bound for the cardinality of the restricted sumset A+0B = fa + b j a 2 ...
We determine the sharp lower bound for the cardinality of the restricted sumset A+' B = {a + b | a ∈...
AbstractWe determine explicitly the least possible size of the sumset of two subsetsA, B⊂(Z/pZ)Nwith...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractIn this paper we determine the bounds of using two analytical algorithms for the subset-sum ...
The main objective of this thesis is to present and prove Plünnecke's Inequality, a theorem that giv...
We study the relationship between the number of minus signs in a generalized sumset, A+ · · ·+A − ...
AbstractLet A be a set of nonnegative integers. For h≥2, denote by hA the set of all the integers re...
We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmer...
Let A be a subset of a ring with cardinality |A | = N. The sum set and the product set are 2A = A+A...
We give a new proof of a sumset conjecture of Furstenberg that was rst proved by Hochman and Shmerki...
AbstractWe give tight lower bounds on the cardinality of the sumset of two finite, nonempty subsets ...
AbstractFor finite non-empty sets of integers A and B put A+̂B=}a+b: a∈A,b∈B,a≠b{. In this paper, we...
AbstractIn this paper we determine the bounds of using two analytical algorithms for the subset-sum ...