Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the size and structure of $t$-representable sumsets

Published 18 Apr 2023 in math.CO and math.NT | (2304.08694v3)

Abstract: Let $A\subseteq \mathbb{Z}{\geq 0}$ be a finite set with minimum element $0$, maximum element $m$, and $\ell$ elements strictly in between. Write $(hA){(t)}$ for the set of integers that can be written in at least $t$ ways as a sum of $h$ elements of $A$. We prove that $(hA){(t)}$ is "structured" for [ h \geq (1+o(1)) \frac{1}{e} m\ell t{1/\ell} ] (as $\ell \to \infty$, $t{1/\ell} \to \infty$), and prove a similar theorem on the size and structure of $A\subseteq \mathbb{Z}d$ for $h$ sufficiently large. Moreover, we construct a family of sets $A = A(m,\ell,t)\subseteq \mathbb{Z}{\geq 0}$ for which $(hA){(t)}$ is not structured for $h\ll m\ell t{1/\ell}$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.