On the structure of t-representable sumsets

arXiv2304.08694MaRDI QIDQ6433443FDOQ6433443

Publication date: 17 April 2023

Abstract: Let

A s u b s e t e q m a t h b b Z_{g e q 0}

be a finite set with minimum element

0

, maximum element

m

, and

e l l

elements in between. Write

(h A)^{(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

(h A)^{(t)}

is ``structured for [ h gtrsim frac{1}{e} mell t^{1/ell}, ] and prove a similar theorem for $A s u b s e t e q m a t h b b Z^{d}$ and $h$ sufficiently large, with some explicit bounds on how large. Moreover, we construct a family of sets $A = A (m, e l l, t) s u b s e t e q m a t h b b Z_{g e q 0}$ for which $(h A)^{(t)}$ is not structured for $h l l m e l l t^{1 / e l l}$ .

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) The Frobenius problem (11D07)

This page was built for publication: On the structure of $t$-representable sumsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6433443)