Sumsets as unions of sumsets of subsets
From MaRDI portal
Publication:4645019
Abstract: Let and be subsets of . We show there are subsets of and of such that is the union of and , with bounded by with . 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.
Recommendations
- scientific article; zbMATH DE number 2212148
- scientific article; zbMATH DE number 746096
- Sum-intersective sets
- Subset sums
- Sumsets with distinct summands
- scientific article; zbMATH DE number 5663738
- On subset sums of \(r\)-sets
- scientific article; zbMATH DE number 440734
- A generalization of sumsets of set of integers
- Sumsets in difference sets
Cites work
- Combinatorial Nullstellensatz
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On cap sets and the group-theoretic approach to matrix multiplication
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
Cited in
(6)- Sum-intersective sets
- scientific article; zbMATH DE number 2212148 (Why is no real title available?)
- On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero
- scientific article; zbMATH DE number 440734 (Why is no real title available?)
- Small subsets with large sumset: beyond the Cauchy-Davenport bound
- New applications of the polynomial method: the cap set conjecture and beyond
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)