Abstract
Let be the field with elements with prime, pairwise disjoint subsets of with at least elements such that , and the set of permutations of . If are not all equal, we characterize the subsets 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 , and as above, we characterize the colorings where each color class has at least 3 elements such that has not rainbow solutions.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.