pith. sign in

arxiv: 1804.08837 · v2 · pith:IDFIWR6Knew · submitted 2018-04-24 · 🧮 math.CO

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

classification 🧮 math.CO
keywords boundlowermathbbsum-freecoloredkleinberg-sawin-speyermaximumresult
0
0 comments X
read the original 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 $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}_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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.