A structural approach to subset-sum problems

2008/04/20 by Van Vu, Van V. Vu, Vu, Van
Mathematics · #05D99 #11P70 #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO #msc:05D99 #msc:11P70

paper · pdf · doi:10.48550/arxiv.0804.3211

arxiv created 2008/04/20 · openalex publication_date 2008/04/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We discuss a structural approach to subset-sum problems in additive combinatorics. The core of this approach are Freiman-type structural theorems, many of which will be presented through the paper. These results have applications in various areas, such as number theory, combinatorics and mathematical physics.

Related

• A Walk Through Some Newer Parts of Additive Combinatorics
• Extremal problems and the combinatorics of sumsets
• On the structures of subset sums in higher dimension
• Roth-type theorems in additive combinatroics
• The Uniformity Conjecture in Additive Combinatorics