2000 character limit reached
Sums of Finite Sets of Integers, II
Published 21 May 2020 in math.NT and math.CO | (2005.10809v3)
Abstract: Let $\mathcal{A}$ be a finite set of integers, and let $h\mathcal{A}$ denote the $h$-fold sumset of $\mathcal{A}$. Let $(h\mathcal{A}){(t)}$ be subset of $h\mathcal{A}$ consisting of all integers that have at least $t$ representations as a sum of $h$ elements of $\mathcal{A}$. The structure of the set $(h\mathcal{A}){(t)}$ is completely determined for all $h \geq h_t$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.