2000 character limit reached
Chromatic sumsets
Published 17 Jun 2020 in math.NT and math.CO | (2006.10170v2)
Abstract: Let $\mathbf{A} = (A_1,\ldots, A_q)$ be a $q$-tuple of finite sets of integers. Associated to every $q$-tuple of nonnegative integers $\mathbf{h} = (h_1,\ldots, h_q)$ is the linear form $\mathbf{h}\cdot \mathbf{A} = h_1 A_1 + \cdots + h_qA_q$. The set $(\mathbf{h}\cdot \mathbf{A} ){(t)}$ consists of all elements of this sumset with at least $t$ representations. The structure of the set $(\mathbf{h}\cdot \mathbf{A} ){(t)}$ is computed for all sufficiently large $h_i$.
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.