English

A lower bound for the $k$-multicolored sum-free problem in $\mathbb{Z}^n_m$

Combinatorics 2018-12-26 v2

Abstract

In this paper, we give a lower bound for the maximum size of a kk-colored sum-free set in Zmn\mathbb{Z}_m^n, where k3k\geq 3 and m2m\geq 2 are fixed and nn tends to infinity. If mm is a prime power, this lower bound matches (up to lower order terms) the previously known upper bound for the maximum size of a kk-colored sum-free set in Zmn\mathbb{Z}_m^n. This generalizes a result of Kleinberg-Sawin-Speyer for the case k=3k=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.

Keywords

Cite

@article{arxiv.1804.08837,
  title  = {A lower bound for the $k$-multicolored sum-free problem in $\mathbb{Z}^n_m$},
  author = {László Miklós Lovász and Lisa Sauermann},
  journal= {arXiv preprint arXiv:1804.08837},
  year   = {2018}
}
R2 v1 2026-06-23T01:33:30.304Z