An inverse theorem in $\mathbb{F}_p$ and rainbow free colorings

TL;DR

This paper characterizes certain subset configurations in finite fields that satisfy a union size inequality involving permutations, with applications to rainbow-free colorings in additive combinatorics.

Contribution

It provides a new inverse theorem in finite fields characterizing subsets with restricted sumset unions and applies it to rainbow-free colorings avoiding specific linear equations.

Findings

Characterization of subsets satisfying the union size inequality.

Identification of conditions for rainbow-free colorings in finite fields.

Extension of inverse theorems to permutation sumsets.

Abstract

Let $\mathbb{F}_p$ be the field with $p$ elements with $p$ prime, $X_1,\ldots, X_n$ pairwise disjoint subsets of $\mathbb{F}_p$with at least $3$ elements such that $\sum_{i=1}^n|X_i|\leq p-5$, and $\mathbb{S}_n$ the set of permutations of $\{1,2,\ldots, n\}$. If $a_1,\ldots,a_n\in\mathbb{F}_p^*$ are not all equal, we characterize the subsets $X_1,\ldots, X_n$ which satisfy \begin{equation*} \Bigg|\bigcup_{\sigma\in\mathbb{S}_n}\sum_{i=1}^na_{\sigma(i)}X_i\Bigg|\leq \sum_{i=1}^n|X_i|. \end{equation*} This result has the following application: For $n\geq 2$, $b\in\mathbb{F}_p$ and $a_1,\ldots, a_n$ as above, we characterize the colorings $\bigcup_{i=1}^nC_i=\mathbb{F}_p$ where each color class has at least 3 elements such that $\sum_{i=1}^na_ix_i=b$ has not rainbow solutions.