Large sum-free sets in finite vector spaces I
Combinatorics
2024-08-29 v2
Abstract
Let be a prime number with and let be a dimension. It is known that a sum-free subset of can have at most the size and that, up to automorphisms of , the only extremal example is the `cuboid' . For we show that if a sum-free subset of is not contained in such an extremal one, then its size is at most . This bound is optimal and we classify the extremal configurations. The remaining cases are known to behave differently. For the analogous question was solved by Vsevolod Lev, and for it is less interesting.
Cite
@article{arxiv.2408.11232,
title = {Large sum-free sets in finite vector spaces I},
author = {Christian Reiher and Sofia Zotova},
journal= {arXiv preprint arXiv:2408.11232},
year = {2024}
}
Comments
added acknowledgement