3 papers
cs.DM2021
On a Communication Complexity problem in Combinatorial Number Theory
Bence Bakos, Norbert Hegyvári, Máté Pálfy
The original knapsack problem is well known to be NP-complete. In a multidimensional version one have to decide whether a is in a sumset-sum of a set …
math.NT2019
On the density of sumsets and product sets
Norbert Hegyvári, François Hennecart, Péter Pál Pach
In this paper some links between the density of a set of integers and the density of its sumset, product set and set of subset sums are presented.
math.NT2012
Distribution of residues in approximate subgroups of
Norbert Hegyvári, Francois Hennecart
We extend a result due to Bourgain on the uniform distribution of residues by proving that subsets of the type is equidistributed (as tends to infinity) where …