Add to ORKGIn the dissertation various phenomena and concepts of arithmetic nature, such as sumsets, additive energy and Sidon sets are investigated. The main problem of the dissertation is finding extremal (in the combinatorial sense) sets, their size and structure
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.Cataloged fro...
This paper investigates the structural properties of sets in NP-P and shows that the computational d...
International audienceWe provide a systematic deterministic numerical scheme to approximate the volu...
In the dissertation various phenomena and concepts of arithmetic nature, such as sumsets, additive e...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
This dissertation deals with four problems concerning arithmetic structures in densesets of integers...
Abstract. We study finite and infinite Sidon sets in Nd. The additive energy of two sets is used to ...
AbstractThis paper is a survey of open problems and results involving extremal size of collections o...
International audienceIn this paper some links between the density of a set of integers and the dens...
A general problem in Extremal Combinatorics asks about the maximum size of a collection of finite ob...
We prove various results in additive combinatorics for subsets of random sets. In particular we exte...
One of the great appeals of Extremal Set Theory as a subject is that the statements are easily acces...
AbstractWe study finite and infinite Sidon sets in Nd. The additive energy of two sets is used to ob...
The main focus of these lectures is basis extremal problems and inequalities – two sides of the same...
A general class of polynomials is defined which includes as subcases sparse and dense polynomials. F...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.Cataloged fro...
This paper investigates the structural properties of sets in NP-P and shows that the computational d...
International audienceWe provide a systematic deterministic numerical scheme to approximate the volu...
In the dissertation various phenomena and concepts of arithmetic nature, such as sumsets, additive e...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
This dissertation deals with four problems concerning arithmetic structures in densesets of integers...
Abstract. We study finite and infinite Sidon sets in Nd. The additive energy of two sets is used to ...
AbstractThis paper is a survey of open problems and results involving extremal size of collections o...
International audienceIn this paper some links between the density of a set of integers and the dens...
A general problem in Extremal Combinatorics asks about the maximum size of a collection of finite ob...
We prove various results in additive combinatorics for subsets of random sets. In particular we exte...
One of the great appeals of Extremal Set Theory as a subject is that the statements are easily acces...
AbstractWe study finite and infinite Sidon sets in Nd. The additive energy of two sets is used to ob...
The main focus of these lectures is basis extremal problems and inequalities – two sides of the same...
A general class of polynomials is defined which includes as subcases sparse and dense polynomials. F...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.Cataloged fro...
This paper investigates the structural properties of sets in NP-P and shows that the computational d...
International audienceWe provide a systematic deterministic numerical scheme to approximate the volu...