An inverse theorem in Z/pZ and rainbow-free colorings
From MaRDI portal
Publication:1681900
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 �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 , and as above, we characterize the colorings where each color class has at least 3 elements such that has not rainbow solutions.
Recommendations
- Rainbow solutions of linear equations over \(\mathbb Z_p\)
- scientific article; zbMATH DE number 7283881
- The structure of rainbow-free colorings for linear equations on three variables in \(\mathbb Z_{p}\)
- Rainbow-free colorings for x+y=cz in Z_p
- Rainbow numbers of \(\mathbb{Z}_n\) for \(a_1x_1+a_2x_2+a_3x_3 =b\)
Cited in
(6)- On rainbow solutions to an equation with a quadratic term
- scientific article; zbMATH DE number 7283881 (Why is no real title available?)
- Rainbow-free colorings for x+y=cz in Z_p
- Rainbow solutions of a linear equation with coefficients in \(\mathbb{Z}/p\mathbb{Z}\)
- The structure of rainbow-free colorings for linear equations on three variables in \(\mathbb Z_{p}\)
- Rainbow numbers of \(\mathbb{Z}_n\) for \(a_1x_1+a_2x_2+a_3x_3 =b\)
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)