activity
20102026
most citedExplicit constructions of extractors and expanders

39 citations · 49 across the 11 of their papers we have counts for

collaborators

13 papers

math.CO2026

Arithmetic Progressions in a Random Binary Subset-Sum Set

Norbert Hegyvári, Thang Pham, Boqing Xue

Let be a binary sequence, and define \[ X_0=1,\qquad X_{n+1}=2X_n+u_n \qquad(n\ge0). \] Let be the set of all nonempty finite subset sums of the sequence $(…

math.CO2026

Subset-Sum Density Realization in Locally Finite Abelian Groups

Norbert Hegyvári, Thang Pham, Boqing Xue

Let be a countable locally finite abelian group, and let \[ G_1\leq G_2\leq\cdots, \qquad \bigcup_{i\geq1}G_i=G, \] be any filtration of by finite subgroups. For $A\subsete…

math.CO2024

Packing sets under finite groups via algebraic incidence structures

Norbert Hegyvári, Le Quang Hung, Alex Iosevich +1

Let be a finite group acting on a vector space over a prime field. Given finite sets and , we study the restricted orbit union $…

math.CO2024

On the structures of subset sums in higher dimension

Norbert Hegyvári, Máté Pálfy, Erfei Yue

A given subset of natural numbers is said to be complete if every element of is the sum of distinct terms taken from . This topic is strongly connected to the knapsack…

math.CO2023

On arithmetic sums of Cantor-type sequences of integers

Norbert Hegyvári

We are looking for integer sets that resemble classical Cantor set and investigate the structure of their sum sets. Especially we investigate the subset sum of sequence typ…

math.CO2023

On the distribution of subset sums of certain sets in

Norbert Hegyvári

A given subset of natural numbers is said to be complete if every element of is the sum of distinct terms taken from . This topic is strongly connected to the k…

math.CO2023

Covering shrinking polynomials by quasi progressions

Norbert Hegyvári

Erd\H os introduced the quantity , where are arithmetic progressions, and cover the square numbers up to . He conjectured that is close…

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.NT2013★ 10 cited

A Structure result for bricks in Heisenberg groups

Norbert Hegyvári, François Hennecart

We show that for a sufficiently big \textit{brick} of the -dimensional Heisenberg group over the finite field , the product set contains…

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 …

math.NT2012★ 39 cited

Explicit constructions of extractors and expanders

Norbert Hegyvári, François Hennecart

We investigate 2-variable expanders and 3-source extractors in prime fields. We extend previous results of J. Bourgain.

math.NT2010

Iterated compositions of linear operations on sets of positive upper density

Norbert Hegyvári, Francois Hennecart, Alain Plagne

Starting from a result of Stewart, Tijdeman and Ruzsa on iterated difference sequences, we introduce the notion of iterated compositions of linear operations. We prove a general re…