Sumsets as unions of sumsets of subsets

DOI10.19086/DA.2103zbMATH Open1404.11008arXiv1612.01929OpenAlexW2964266202WikidataQ129722966 ScholiaQ129722966MaRDI QIDQ4645019FDOQ4645019

Authors: Jordan S. Ellenberg

Publication date: 9 January 2019

Published in: Discrete Analysis (Search for Journal in Brave)

Abstract: Let

S

and

T

be subsets of

m a t h b f F_{q}^{n}

. We show there are subsets

S^{'}

of

S

and

T^{'}

of

T

such that

S + T

is the union of

S + T^{'}

and

S^{'} + T

, with

| S^{'} | + | T^{'} |

bounded by

c^{n}

with

c < q

. The proof relies on the method of Croot-Lev-Pach and Ellenberg-Gijswijt on the cap set problem, together with a result of Meshulam on linear spaces of low-rank matrices. The result is a modest generalization of the recent bounds on (single-colored and multi-colored) sum-free sets by the author and others.

Full work available at URL: https://arxiv.org/abs/1612.01929

Recommendations

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Additive bases, including sumsets (11B13)

Cites Work

Cited In (5)

This page was built for publication: Sumsets as unions of sumsets of subsets

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