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

preprint2015arXivOpen access

Abstract

Let Fp\mathbb{F}_p be the field with pp elements with pp prime, X1,…,XnX_1,\ldots, X_n pairwise disjoint subsets of Fp\mathbb{F}_pwith at least 33 elements such that ∑i=1n∣Xi∣≤p−5\sum_{i=1}^n|X_i|\leq p-5, and Sn\mathbb{S}_n the set of permutations of {1,2,…,n}\{1,2,\ldots, n\}. If a1,…,an∈Fp∗a_1,\ldots,a_n\in\mathbb{F}_p^* are not all equal, we characterize the subsets X1,…,XnX_1,\ldots, X_n which satisfy \begin{equation*} \Bigg|\bigcup_{σ\in\mathbb{S}_n}\sum_{i=1}^na_{σ(i)}X_i\Bigg|\leq \sum_{i=1}^n|X_i|. \end{equation*} This result has the following application: For n≥2n\geq 2, b∈Fpb\in\mathbb{F}_p and a1,…,ana_1,\ldots, a_n as above, we characterize the colorings ⋃i=1nCi=Fp\bigcup_{i=1}^nC_i=\mathbb{F}_p where each color class has at least 3 elements such that ∑i=1naixi=b\sum_{i=1}^na_ix_i=b has not rainbow solutions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.