2000 character limit reached
A lower bound for the $k$-multicolored sum-free problem in $\mathbb{Z}^n_m$
Published 24 Apr 2018 in math.CO | (1804.08837v2)
Abstract: In this paper, we give a lower bound for the maximum size of a $k$-colored sum-free set in $\mathbb{Z}_mn$, where $k\geq 3$ and $m\geq 2$ 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}_mn$. 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.