2000 character limit reached
On the structures of subset sums in higher dimension (2405.02269v2)
Published 3 May 2024 in math.CO and math.NT
Abstract: A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of the paper is to study the structure of subset sums in a higher dimension. We show 'dense' sets and generalized arithmetic progrssions in subset sums of certain sets.