A lower bound for the k-multicolored sum-free problem in Z_m^n

DOI10.1112/PLMS.12223zbMATH Open1452.11016arXiv1804.08837OpenAlexW3099671403WikidataQ128737590 ScholiaQ128737590MaRDI QIDQ5229326FDOQ5229326

Authors: László Miklós Lovász, Lisa Sauermann 

Publication date: 14 August 2019

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Abstract: In this paper, we give a lower bound for the maximum size of a $k$-colored sum-free set in $mathbb{Z}_m^n$, where $kgeq3$ and $mgeq2$ are fixed and $n$ tends to infinity. If $m$ is a prime power, this lower bound matches (up to lower order terms) the previously known upper bound for the maximum size of a $k$-colored sum-free set in $mathbb{Z}_m^n$. This generalizes a result of Kleinberg-Sawin-Speyer for the case $k=3$ and as part of our proof we also generalize a result by Pebody that was used in the work of Kleinberg-Sawin-Speyer. Both of these generalizations require several key new ideas.

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

Recommendations

• Proof of a conjecture of Kleinberg-Sawin-Speyer
• Some new results on subset sums
• The growth of tri-colored sum-free sets
• On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero
• On sumfree subsets of hypercubes

zbMATH Keywords

discrete non-negative integer-valued distributionsCroot-Lev-Pach polynomial method\(k\)-colored sum-free sets

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30) Combinatorial aspects of groups and algebras (05E16)

Cited In (6)

• On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero
• Removal lemmas and approximate homomorphisms
• Proof of a conjecture of Kleinberg-Sawin-Speyer
• On subsets of the hypercube with prescribed Hamming distances
• On arithmetic progressions in symmetric sets in finite field model
• The growth of tri-colored sum-free sets

This page was built for publication: A lower bound for the \(k\)-multicolored sum-free problem in \(\mathbb{Z}_m^n\)

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