An inverse theorem in Z/pZ and rainbow-free colorings

From MaRDI portal
Publication:1681900




Abstract: Let mathbbFp be the field with p elements with p prime, X1,ldots,Xn pairwise disjoint subsets of mathbbFpwith at least 3 elements such that sumi=1n|Xi|leqp5, and mathbbSn the set of permutations of 1,2,ldots,n. If a1,ldots,aninmathbbFp are not all equal, we characterize the subsets X1,ldots,Xn which satisfy �egin{equation*} Bigg|�igcup_{sigmainmathbb{S}_n}sum_{i=1}^na_{sigma(i)}X_iBigg|leq sum_{i=1}^n|X_i|. end{equation*} This result has the following application: For ngeq2, binmathbbFp and a1,ldots,an as above, we characterize the colorings where each color class has at least 3 elements such that sumi=1naixi=b has not rainbow solutions.









This page was built for publication: An inverse theorem in \(\mathbb{Z}/p\mathbb{Z}\) and rainbow-free colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1681900)